Relevant bibliographies by topics / Cut vertex

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Cut vertex'

Author: Grafiati
Published: 3 June 2025
Last updated: 22 June 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Cut vertex.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Cut vertex"

1

Safeera, K., and V. Anil Kumar. "VERTEX CUT POLYNOMIAL OF GRAPHS." Advances and Applications in Discrete Mathematics 32 (June 1, 2022): 1–12. http://dx.doi.org/10.17654/0974165822028.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Cornaz, Denis, Fabio Furini, Mathieu Lacroix, Enrico Malaguti, A. Ridha Mahjoub, and Sébastien Martin. "The vertex k-cut problem." Discrete Optimization 31 (February 2019): 8–28. http://dx.doi.org/10.1016/j.disopt.2018.07.003.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Baskar, Nivedha, Tabitha Agnes Mangam, and Rohith Raja. "On block-related derived graphs." Gulf Journal of Mathematics 18, no. 2 (2024): 70–86. https://doi.org/10.56947/gjom.v18i2.2284.

Full text
Abstract:
The cut vertex of a graph G is a vertex whose removal increases the number of components in the graph. A maximal connected subgraph with no cut vertex is called a block of the graph. This paper introduces and analyses the block-degree of a vertex and the cut-degree of a block. The block-degree of a vertex v is the number of blocks containing v. The cut-degree of a block b is the number of cut vertices of G contained in b. Given the block-degree sequence of cut vertices of a graph, the number of blocks of the graph and bounds on the order and size of the graph are studied. The block graph (B(G)) of a graph G is the graph whose vertices are blocks of G in which two vertices are adjacent whenever the corresponding blocks have a vertex in common. The number of cut vertices in B(G) is obtained and the graphs for which B(G) has exactly one cut vertex are characterized. Further, an investigation is carried out on the traversability of B(G). The block cut point graph BC(G) of a graph G is the graph whose vertices are the union of the set of blocks and the set of cut vertices of G and in which two vertices are adjacent if it corresponds to a block b of G and the other to a cut vertex c of G and c belongs to b in G. The properties of BC(G) and its iterations are studied. The graph G for which BC(G) is a perfect m-ary tree is characterised.
APA, Harvard, Vancouver, ISO, and other styles
4

Vimala, S., and A. Amala. "Topologized Cut Vertex and Edge Deletion." Asian Research Journal of Mathematics 5, no. 1 (2017): 1–12. http://dx.doi.org/10.9734/arjom/2017/33108.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Li, Yalan, Shumin Zhang, and Chengfu Ye. "On Cyclic-Vertex Connectivity of n , k -Star Graphs." Mathematical Problems in Engineering 2021 (April 12, 2021): 1–4. http://dx.doi.org/10.1155/2021/5570761.

Full text
Abstract:
A vertex subset F ⊆ V G is a cyclic vertex-cut of a connected graph G if G − F is disconnected and at least two of its components contain cycles. The cyclic vertex-connectivity κ c G is denoted as the cardinality of a minimum cyclic vertex-cut. In this paper, we show that the cyclic vertex-connectivity of the n , k -star network S n , k is κ c S n , k = n + 2 k − 5 for any integer n ≥ 4 and k ≥ 2 .
APA, Harvard, Vancouver, ISO, and other styles
6

Yurttas Gunes, Aysun, Muge Togan, Feriha Celik, and Ismail Naci Cangul. "Cut vertex and cut edge problem for topological graph indices." Journal of Taibah University for Science 13, no. 1 (2019): 1175–83. http://dx.doi.org/10.1080/16583655.2019.1695520.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

LIU, QINGHAI, ZHAO ZHANG, and ZHIHUA YU. "CYCLIC CONNECTIVITY OF STAR GRAPH." Discrete Mathematics, Algorithms and Applications 03, no. 04 (2011): 433–42. http://dx.doi.org/10.1142/s1793830911001322.

Full text
Abstract:
For a connected graph G, a vertex subset F ⊂ V(G) is a cyclic vertex-cut of G if G - F is disconnected and at least two of its components contain cycles. The cardinality of a minimum cyclic vertex-cut of G, denoted by κc(G), is the cyclic vertex-connectivity of G. In this paper, we show that for any integer n ≥ 4, the n-dimensional star graph SGn has κc(SGn) = 6(n - 3).
APA, Harvard, Vancouver, ISO, and other styles
8

Vujošević, Saša. "Computation of edge Pi index, vertex Pi index and Szeged index of some cactus chains." Mathematica Montisnigri 54 (2022): 14–24. http://dx.doi.org/10.20948/mathmontis-2022-54-2.

Full text
Abstract:
A cactus chain is a connected graph in which all blocks are cycles, each cycle has at most two cut-vertices and each cut-vertex is shared by exactly two cycles. In this paper we give exact values of edge PI index and vertex PI index of an arbitrary cactus chain and vertex Szeged index of some special types of cactus chains.
APA, Harvard, Vancouver, ISO, and other styles
9

Dewar, Megan, David Pike, and John Proos. "Connectivity in Hypergraphs." Canadian Mathematical Bulletin 61, no. 2 (2018): 252–71. http://dx.doi.org/10.4153/cmb-2018-005-9.

Full text
Abstract:
AbstractIn this paper we consider two natural notions of connectivity for hypergraphs: weak and strong. We prove that the strong vertex connectivity of a connected hypergraph is bounded by its weak edge connectivity, thereby extending a theorem of Whitney from graphs to hypergraphs. We find that, while determining a minimum weak vertex cut can be done in polynomial time and is equivalent to finding a minimum vertex cut in the 2-section of the hypergraph in question, determining a minimum strong vertex cut is NP-hard for general hypergraphs. Moreover, the problem of finding minimum strong vertex cuts remains NP-hard when restricted to hypergraphs with maximum edge size at most 3. We also discuss the relationship between strong vertex connectivity and the minimum transversal problem for hypergraphs, showing that there are classes of hypergraphs for which one of the problems is NP-hard, while the other can be solved in polynomial time.
APA, Harvard, Vancouver, ISO, and other styles
10

Nazeer, Irfan, Tabasam Rashid, and Muhammad Tanveer Hussain. "Cyclic connectivity index of fuzzy incidence graphs with applications in the highway system of different cities to minimize road accidents and in a network of different computers." PLOS ONE 16, no. 9 (2021): e0257642. http://dx.doi.org/10.1371/journal.pone.0257642.

Full text
Abstract:
A parameter is a numerical factor whose values help us to identify a system. Connectivity parameters are essential in the analysis of connectivity of various kinds of networks. In graphs, the strength of a cycle is always one. But, in a fuzzy incidence graph (FIG), the strengths of cycles may vary even for a given pair of vertices. Cyclic reachability is an attribute that decides the overall connectedness of any network. In graph the cycle connectivity (CC) from vertex a to vertex b and from vertex b to vertex a is always one. In fuzzy graph (FG) the CC from vertex a to vertex b and from vertex b to vertex a is always same. But if someone is interested in finding CC from vertex a to an edge ab, then graphs and FGs cannot answer this question. Therefore, in this research article, we proposed the idea of CC for FIG. Because in FIG, we can find CC from vertex a to vertex b and also from vertex a to an edge ab. Also, we proposed the idea of CC of fuzzy incidence cycles (FICs) and complete fuzzy incidence graphs (CFIGs). The fuzzy incidence cyclic cut-vertex, fuzzy incidence cyclic bridge, and fuzzy incidence cyclic cut pair are established. A condition for CFIG to have fuzzy incidence cyclic cut-vertex is examined. Cyclic connectivity index and average cyclic connectivity index of FIG are also investigated. Three different types of vertices, such as cyclic connectivity increasing vertex, cyclically neutral vertex and, cyclic connectivity decreasing vertex, are also defined. The real-life applications of CC of FIG in a highway system of different cities to minimize road accidents and a computer network to find the best computers among all other computers are also provided.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Cut vertex"

1

Magnouche, Youcef. "The multi-terminal vertex separator problem : Complexity, Polyhedra and Algorithms." Thesis, Paris Sciences et Lettres (ComUE), 2017. http://www.theses.fr/2017PSLED020/document.

Full text
Abstract:
Étant donné un graphe G = (V U T, E), tel que V U T représente l'ensemble des sommets où T est un ensemble de terminaux, et une fonction poids w associée aux sommets non terminaux, le problème du séparateur de poids minimum consiste à partitionner V U T en k + 1 sous-ensembles {S, V1,..., Vk} tel qu'il n'y a aucune arête entre deux sous-ensembles différents Vi et Vj, chaque Vi contient exactement un terminal et le poids de S est minimum. Dans cette thèse, nous étudions le problème d'un point de vue polyèdral. Nous donnons deux formulations en nombres entiers pour le problème, et pour une de ces formulations, nous étudions le polyèdre associé. Nous présentons plusieurs inégalités valides, et décrivons des conditions de facette. En utilisant ces résultats, nous développons un algorithme de coupes et branchement pour le problème. Nous étudions également le polytope des séparateurs dans les graphes décomposables par sommets d'articulation. Si G est un graphe qui se décompose en G1 et G2, alors nous montrons que le polytope des séparateurs dans G peut être décrit à partir de deux systèmes linéaires liés à G1 et G2. Ceci donne lieu à une technique permettant de caractériser le polytope des séparateurs dans les graphes qui sont récursivement décomposables. Ensuite, nous étudions des formulations étendues pour le problème et proposons des algorithmes de génération de colonnes et branchement ainsi que des algorithmes de génération de colonnes, de coupes et branchement. Pour chaque formulation, nous présentons un algorithme de génération de colonnes, une procedure pour le calcul de la borne duale ainsi qu'une règle de branchement. De plus, nous présentons quatre variantes du problème du séparateur. Nous montrons que celles-ci sont NP-difficiles, et pour chacune d'elles nous donnons une formulation en nombres entiers et présentons certaines classes d'inégalités valides<br>Given a graph G = (V U T, E) with V U T the set of vertices, where T is a set of terminals, and a weight function w, associated with the nonterminal nodes, the multi-terminal vertex separator problem consists in partitioning V U T into k + 1 subsets {S, V1,..., Vk} such that there is no edge between two different subsets Vi and Vj, each Vi contains exactly one terminal and the weight of S is minimum. In this thesis, we consider the problem from a polyhedral point of view. We give two integer programming formulations for the problem, for one of them, we investigate the related polyhedron. We describe some valid inequalities and characterize when these inequalities define facets. Using these results, we develop a Branch-and-Cut algorithm for the problem. We also study the multi-terminal vertex separator polytope in the graphs decomposable by one node cutsets. If G is a graph that decomposes into G1 and G2, we show that the multi-terminal vertex separator polytope in G can be described from two linear systems related to G1 and G2. This gives rise to a technique for characterizing the multi-terminal vertex separator polytope in the graphs that are recursively decomposable. Moreover, we propose three extended formulations for the problem and derive Branch-and-Price and Branch-and-Cut-and-Price algorithms. For each formulation we present a column generation scheme, the way to compute the dual bound, and the branching scheme. Finally, we discuss four variants of the multi-terminal vertex separator problem. We show that all these variants are NP-hard and for each one we give an integer programming formulation and present some class of valid inequalities
APA, Harvard, Vancouver, ISO, and other styles
2

Seyed, Khamoushi Seyed Mohammadreza. "Scalable Streaming Graph Partitioning." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-206113.

Full text
Abstract:
Large-scale graph-structured datasets are growing at an increasing rate. Social network graphs are an example of these datasets. Processing large-scale graphstructured datasets are central to many applications ranging from telecommunication to biology and has led to the development of many parallel graph algorithms. Performance of parallel graph algorithms largely depends on how the underlying graph is partitioned. In this work, we focus on studying streaming vertex-cut graph partitioning algorithms where partitioners receive a graph as a stream of vertices and edges and assign partitions to them on their arrival once and for all. Some of these algorithms maintain a state during partitioning. In some cases, the size of the state is so huge that it cannot be kept in a single machine memory. In many real world scenarios, several instances of a streaming graph partitioning algorithm are run simultaneously to improve the system throughput. However, running several instances of a partitioner drops the partitioning quality considerably due to the incomplete information of partitioners. Even frequently sharing states and its combination with buffering mechanisms does not completely solves the problem because of the heavy communication overhead produced by partitioners. In this thesis, we propose an algorithm which tackles the problem of low scalability and performance of existing streaming graph partitioning algorithms by providing an efficient way of sharing states and its combination with windowing mechanism. We compare state-of-the-art streaming graph partitioning algorithms with our proposed solution concerning performance and efficiency. Our solution combines a batch processing method with a shared-state mechanism to achieve both an outstanding performance and a high partitioning quality. Shared state mechanism is used for sharing states of partitioners. We provide a robust implementation of our method in a PowerGraph framework. Furthermore, we empirically evaluate the impact of partitioning quality on how graph algorithms perform in a real cloud environment. The results show that our proposed method outperforms other algorithms in terms of partitioning quality and resource consumption and improves partitioning time considerably. On average our method improves partitioning time by 23%, decreases communication load by 15% and increase memory consumption by only 5% compared to the state-of-the-art streaming graph partitioning.
APA, Harvard, Vancouver, ISO, and other styles
3

Campos, Victor Almeida. "Um estudo do politopo e dos limites inferiores gerados pela formulaÃÃo de coloraÃÃo dos representantes." Universidade Federal do CearÃ, 2005. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=2159.

Full text
Abstract:
Conselho Nacional de Desenvolvimento CientÃfico e TecnolÃgico<br>O problema de coloraÃÃo de vÃrtices à considerado um dos modelos mais estudados em teoria dos grafos pela sua relevÃncia em campos prÃticos e teÃricos. Do ponto de vista teÃrico, o problema de coloraÃÃo à NP - DifÃcil. AlÃm disto, foi classificado entre os problemas mais difÃceis de NP, no sentido de que achar uma aproximaÃÃo para o nÃmero cromÃtico tambÃm à NP - DifÃcil. A importÃncia do problema de coloraÃÃo tem incentivado a investigar mÃtodos para encontrar limitantes inferiores prÃximos do nÃmero cromÃtico. Historicamente, os primeiros limitantes inferiores utilizados para resolvÃ-lo lidavam com cliques maximais. Mais recentemente, popularizou-se a utilizaÃÃo de relaxaÃÃes lineares de formulaÃÃes de programaÃÃo inteira. Uma formulaÃÃo que mostrou bons limitantes inferiores foi a formulaÃÃo por conjuntos independentes, cujo valor de relaxaÃÃo equivale ao nÃmero cromÃtico fracionÃrio. No presente trabalho, fazemos uma comparaÃÃo entre as formulaÃÃes de programaÃÃo inteira conhecidas para indicar a escolha pela formulaÃÃo dos representantes. Revisamos a formulaÃÃo para remover simetrias existentes e apresentamos um estudo parcial do politopo associado ao fecho convexo de suas soluÃÃes inteiras. Discutimos como à possÃvel utilizar a formulaÃÃo dos representantes para gerar limites inferiores para o nÃmero cromÃtico fracionÃrio. Realizamos a implementaÃÃo de um mÃtodo de planos de corte para aproximar o nÃmero cromÃtico fracionÃrio e mostramos que podemos gerar limitantes inferiores que normalmente nÃo diferem em mais de uma unidade.<br>The vertex coloring problem is one of the most studied problems in graph theory for its relevance in practical and theoretical fields. From a theoretical point of view, it is a NP-Hard problem. Moreover, it is classified among the most difficult problems of NP- Hard in the sense that finding an approximation to the chromatic number is also NP-Hard. The importance of the coloring problem motivates searching for methods to find lower bounds close to the chromatic number. Historically, the first lower bounds used were obtained from the size of maximal cliques. More recently, relaxed integer programming formulations gained more attention. A formulation which found good lower bounds was the coloring problem through stable sets whose relaxed lower bound equals the fractional chromatic number. In this work, we make a comparison between the known integer programming formulations to motivate our choice for the Representatives formulation. We revise this formulation to remove symmetry and present a partial study of the polytope associated with the convex hull of its integer solutions. We discuss how to se the Representatives formulation to get lower bounds for the fractional chromatic number and we show how to get such lower bounds that differ at most by one unit to its exact value.
APA, Harvard, Vancouver, ISO, and other styles
4

Smith, Caitlin Vanessa. "Non conventionalité et généricité dans la catégorisation lexicale d'apprenants en anglais L2 : le cas de "cut" et "break"." Phd thesis, Université Toulouse le Mirail - Toulouse II, 2013. http://tel.archives-ouvertes.fr/tel-00967413.

Full text
Abstract:
Notre travail se focalise sur deux phénomènes observés dans le cadre de l'apprentissage de l'anglais langue seconde (L2) chez des adultes francophones: d'une part, l'usage non conventionnel de verbes, et d'autre part, l'importance du taux de production des verbes génériques (vs spécifiques). Notre population est constituée d'un groupe d'étudiants universitaires francophones en situation d'apprentissage de l'anglais de niveau B1 (population cible), ainsi que d'un groupe de locuteurs d'anglais L1 (population de référence), placés en situation de dénomination orale de 42 vidéos d'actions de type cut et break. Nos résultats montrent des différences significatives entre la manière dont les deux groupes catégorisent ces types d'actions, avec un taux plus élevé de descriptions non conventionnelles et de verbes génériques chez les locuteurs de l'anglais L2. A l'appui de ces résultats, nous soulignons l'importance de l'usage des verbes non conventionnels et génériques, qui constitue des stratégies de communication permettant aux apprenants L2 de pallier leurs lacunes lexicales.
APA, Harvard, Vancouver, ISO, and other styles
5

Chen, Ziang. "Justice and Prudence : Political Virtues in Gerald Odonis's Expositio cum quaestionibus super libros Ethicorum." Electronic Thesis or Diss., Paris, EHESS, 2020. http://www.theses.fr/2020EHES0077.

Full text
Abstract:
Cette thèse doctorale étudie la question de la valeur morale de l'individu et de son existence relative au cadre sociétal et institutionnel, sur la base del'Expositio super libros ethicorum de Guiral Ot. Écrit pendant la première moitié des années 1320, il s’agit du premier commentaire complet écrit par un théologien franciscain sur l’Éthique à Nicomaque d’Aristote. Le commentaire offre un point de vue sur le paysage intellectuel du XIVe siècle, sur l'état des savoirs et de l'éducation, sur la réception d'Aristote, et sur les pensées morales et politiques. Cette œuvre illustre les traditions intellectuelles des frères mineurs et des commentateurs aristotéliciens dont hérite Guiral ainsi que son originalité vis-à-vis de celles ci. Cette thèse explore les circonstances intellectuelles et politiques entourant la composition du commentaire de Guiral et elle tente d’ancrer ce commentaire philosophique dans son propre contexte historique. Cette thèse porte principalement sur les questions discutées dans les livres V et VI, relatifs aux vertus de la justice et de la prudence, ainsi que sur les questions trouvées dans le prologue concernant le sujet, la structure et la fin de la science morale. Dans le schéma médiéval de la philosophie morale, la justice et la prudence constituent les deux piliers des vertus cardinales. La justice est conçue comme une vertu de la volonté et joue un rôle central dans la tradition franciscaine du volontarisme moral; c'est aussi une vertu inexorablement liée au droit et au légalisme, et par conséquent à l'administration gouvernementale et au système judiciaire, thèmes que Guiral a particulièrement approfondis dans son oeuvre. Selon Guiral, la prudence représente bien plus qu'une simple notion propositionnelle issue d'un raisonnement syllogistique; elle est la raison et la liberté intellectuelle qui sous-tendent fondamentalement l'indépendance morale et volontaire de l'individu par rapport aux raisons institutionnelles. Guiral situe l'individu au cœur de toutes les considérations morales et politiques. Il dérive ainsi les principes et la structure de l’éthique de l'expérience de l’individu dans sa société. Dans son commentaire, Guiral démontre une compréhension profonde du volontarisme et du subjectivisme individuel: la liberté volontaire du sujet moral et l'humanité de la personne dépassent toujours la raison institutionnelle et l'être collectiviste<br>The present thesis aims to address the questions on the moral worth of the individual and his existence within a societal and institutional setting by examining Gerald Odonis’s Expositio super libros Ethicorum. Written in the early 1320s, it is the first full-length commentary on Aristotle’s Nicomachean Ethics produced by a Franciscan theologian. It provides a prism into the intellectual landscape of the fourteenth century, on the state of scholarship and education, on the reception of Aristotle, and on the currents of moral and political philosophy. Odonis’s Ethics commentary bears witness to both our author’s originality and the intellectual traditions that he has inherited from both the Minorites and the Aristotelian commentators. The present thesis explores the intellectual and political circumstances surrounding the composition of Odonis’s commentary text, and attempts to anchor the philosophical commentary to its proper historical context. The thesis focuses primarily on Odonis’s question commentary on Books V and VI on the virtues of justice and prudence, as well as questions raised in the prologue concerning the subject, structure, and purpose of moral science. In the medieval scheme of moral philosophy, justice and prudence constitute two pillars of the cardinal virtues. Justice is accepted as a virtue of the will, and plays a central part in the Franciscan tradition of moral voluntarism; it is also a virtue inexorably linked with law and legality, and hence to government administration and the judicial system. All these are reflected in Odonis's writing. For Odonis, prudence represents far more than mere propositional knowledge derived from simple syllogistic reasoning; instead, it is the reason and intellectual freedom that fundamentally underpins the moral and voluntary independence of the individual against reasons of the institution. Odonis places the individual at the core of every moral and political consideration, and understands the scheme and structure of the moral science through the perspective of an individual’s moral experience in society. In his commentary, Odonis displays a profound sense of voluntarism and individual subjectivism: the voluntary freedom of the moral subject and the humanity of the person always surpass the reason and being of the collectivised institutions
APA, Harvard, Vancouver, ISO, and other styles
6

Khaoulani, Sohayb. "Traitement d'eaux usées par adsorption sur des polymères de cyclodextrine et développement de capteurs chimiques à base de membranes de verres de chalcogénures destinées à la détection des ions Hg²⁺." Thesis, Littoral, 2015. http://www.theses.fr/2015DUNK0386/document.

Full text
Abstract:
L'objectif de ce travail a consisté à identifier des polluants émergents dans des eaux usées issues de stations d'épuration ainsi que dans le milieu naturel et à proposer une méthode de remédiation et un suivi de ces polluants. Dans un premier temps, nous avons identifié les polluants organiques contenus dans les échantillons d'eaux usées et issues du milieu naturel par chromatographie en phase liquide ou gazeuse couplée à une spectrométrie de masse, chromatographie en phase gazeuse par espace de tête statique et par spectrométrie par torche à plasma couplée à une spectrométrie de masse. Différents polluants ont été trouvés tels que les phtalates, des substances médicamenteuses, le cholestérol et des éléments de traces métalliques. Dans le but de piéger ces polluants, différents polymères de cyclodextrine (CD) solubles et insolubles dans l'eau ont été synthétisés et leurs capacités d'adsorption ont été évaluées. Après adsorption sur les polymères de CD, nous avons observé une diminution de la teneur en carbone organique total (COT) de l'effluent. Ces polymères se sont révélés être des adsorbants efficaces. Dans un second temps, des verres du système pseudo-ternaire Agl-HgS-As₂S₃ ont été synthétisés en ajoutant le composé le composé Agl dans le système pseudo-binaire HgS-As₂S₃. Ces verres de chalcogénures sont des membranes ionosélectives permettant de détecter les ions Hg²⁺ dans les effluents. Tout d'abord, nous avons défini le domaine vitreux des verres à l'aide de la diffraction des rayons X, ensuite les propriétés macroscopiques des verres ont été déterminées. Ainsi, les propriétés de transport ont été étudiées à l'aide de la spectroscopie d'impédance complexe montrant que l'ajout d'Agl dans le verre pseudo-binaire HgS-As₂S₃ provoque une augmentation de la conductivité ionique. Afin de comprendre ce phénomène, diverses études structurales ont été déployées par spectroscopie Raman, diffraction de neutrons et de rayon X haute énergie. Ces techniques ont montré que l'évolution de la conductivité ionique est dépendante de la structure du verre qui forme des chemins préférentiels de conduction. Enfin, différents capteurs avec différentes compositions sont testés afin de définir la sensibilité, la limite de détection et les coefficients de sélectivité en présence d'ions interférents<br>The aim of this work was to identify the emerging pollutants in the effluents of wastewater treatment plants as well as in the natural environment, and to propose a method of remediation and monitoring of these pollutants. In the first part of the thesis, we have identified the organic pollutants contained in the wastewater samples using (i) gas and/or liquid chromatography coupled with a mass spectrometry, (ii) static-headspace gas chromatography, and (iii) inductively coupled plasma atomic emission spectroscopy. Different pollutants were found such as phthalates, drugs, cholesterol, and heavy metal traces. In order to trap these pollutants, various water soluble/insoluble cyclodextrin β-CD polymers have been synthesized and their adsorption capacities were evaluated. After the analysis of the effluent samples, we observed a decrease of the Total Organic Carbon (TOC). This decrease was attributed to the adsorption of pollutant by CD polymers which have proven to be effective adsorbents. The second part of the thesis included two main sub-parts : (i) a synthesis and characterization part and (ii) an application part. In the first sub-part, chalcogenide glasses in the pseudo-ternary Agl-HgS-As₂S₃ system have been synthesized by adding silver iodide "Agl" to the quasi-binary HgS-As₂S₃ system. The vitreous domain and the macroscopic properties of glass samples were determined. Electrical conductivity of glasses was studied using both the complex impedance spectroscopy and resistivity measurements ; it was found that adding Agl to the quasi-binary HgS-As₂S₃ alloy causes an increase in the ionic conductivity. Structural studies, using various techniques as Raman spectroscopy, neutron scattering and high-energy X-ray diffraction, have been performed in order to decipher the relation between both structural and transport properties in these glasses. In the second sub-part, the obtained glasses in the ternary system were used as membranes in chemical sensors dedicated to mercury detection in aqueous solution. As a result, various sensors with different compositions were tested to determine their corresponding sensitivity, detection limit and selectivity coefficients in the presence of interfering ions
APA, Harvard, Vancouver, ISO, and other styles
7

Georgiou, Konstantinos. "Integrality Gaps for Strong Linear Programming and Semidefinite Programming Relaxations." Thesis, 2010. http://hdl.handle.net/1807/26271.

Full text
Abstract:
The inapproximability for NP-hard combinatorial optimization problems lies in the heart of theoretical computer science. A negative result can be either conditional, where the starting point is a complexity assumption, or unconditional, where the inapproximability holds for a restricted model of computation. Algorithms based on Linear Programming (LP) and Semidefinite Programming (SDP) relaxations are among the most prominent models of computation. The related and common measure of efficiency is the integrality gap, which sets the limitations of the associated algorithmic schemes. A number of systematic procedures, known as lift-and-project systems, have been proposed to improve the integrality gap of standard relaxations. These systems build strong hierarchies of either LP relaxations, such as the Lovasz-Schrijver (LS) and the Sherali-Adams (SA) systems, or SDP relaxations, such as the Lovasz-Schrijver SDP (LS+), the Sherali-Adams SDP (SA+) and the Lasserre (La) systems. In this thesis we prove integrality gap lower bounds for the aforementioned lift-and-project systems and for a number of combinatorial optimization problems, whose inapproximability is yet unresolved. Given that lift-and-project systems produce relaxations that have given the best algorithms known for a series of combinatorial problems, the lower bounds can be read as strong evidence of the inapproximability of the corresponding optimization problems. From the results found in the thesis we highlight the following: For every epsilon>0, the level-Omega(sqrt(log n/ log log n)) LS+ relaxation of the Vertex Cover polytope has integrality gap 2-epsilon. The integrality gap of the standard SDP for Vertex Cover remains 2-o(1) even if all hypermetric inequalities are added to the relaxation. The resulting relaxations are incomparable to the SDP relaxations derived by the LS+ system. Finally, the addition of all ell1 inequalities eliminates all solutions not in the integral hull. For every epsilon>0, the level-Omega(sqrt(log n/ log log n)) SA relaxation of Vertex Cover has integrality gap 2-epsilon. The integrality gap remains tight even for superconstant-level SA+ relaxations. We prove a tight lower bound for the number of tightenings that the SA system needs in order to prove the Pigeonhole Principle. We also prove sublinear and linear rank bounds for the La and SA systems respectively for the Tseitin tautology. Linear levels of the SA+ system treat highly unsatisfiable instances of fixed predicate-P constraint satisfaction problems over q-ary alphabets as fully satisfiable, when the satisfying assignments of the predicates P can be equipped with a balanced and pairwise independent distribution. We study the performance of the Lasserre system on the cut polytope. When the input is the complete graph on 2d+1 vertices, we show that the integrality gap is at least 1+1/(4d(d+1)) for the level-d SDP relaxation.
APA, Harvard, Vancouver, ISO, and other styles
8

Shah, Chintan D. "Boxicity, Cubicity And Vertex Cover." Thesis, 2008. https://etd.iisc.ac.in/handle/2005/890.

Full text
Abstract:
The boxicity of a graph G, denoted as box(G), is the minimum dimension d for which each vertex of G can be mapped to a d-dimensional axis-parallel box in Rd such that two boxes intersect if and only if the corresponding vertices of G are adjacent. An axis-parallel box is a generalized rectangle with sides parallel to the coordinate axes. If additionally, we restrict all sides of the rectangle to be of unit length, the new parameter so obtained is called the cubicity of the graph G, denoted by cub(G). F.S. Roberts had shown that for a graph G with n vertices, box(G) ≤ and cub(G) ≤ . A minimum vertex cover of a graph G is a minimum cardinality subset S of the vertex set of G such that each edge of G has at least one endpoint in S. We show that box(G) ≤ +1 and cub(G)≤ t+ ⌈log2(n −t)⌉−1 where t is the cardinality of a minimum vertex cover. Both these bounds are tight. For a bipartite graph G, we show that box(G) ≤ and this bound is tight. We observe that there exist graphs of very high boxicity but with very low chromatic num-ber. For example, there exist bipartite (2 colorable) graphs with boxicity equal to . Interestingly, if boxicity is very close to , then the chromatic number also has to be very high. In particular, we show that if box(G) = −s, s ≥ 02, then x(G) ≥ where X(G) is the chromatic number of G. We also discuss some known techniques for findingan upper boundon the boxicityof a graph -representing the graph as the intersection of graphs with boxicity 1 (boxicity 1 graphs are known as interval graphs) and covering the complement of the graph by co-interval graphs (a co-interval graph is the complement of an interval graph).
APA, Harvard, Vancouver, ISO, and other styles
9

Shah, Chintan D. "Boxicity, Cubicity And Vertex Cover." Thesis, 2008. http://hdl.handle.net/2005/890.

Full text
Abstract:
The boxicity of a graph G, denoted as box(G), is the minimum dimension d for which each vertex of G can be mapped to a d-dimensional axis-parallel box in Rd such that two boxes intersect if and only if the corresponding vertices of G are adjacent. An axis-parallel box is a generalized rectangle with sides parallel to the coordinate axes. If additionally, we restrict all sides of the rectangle to be of unit length, the new parameter so obtained is called the cubicity of the graph G, denoted by cub(G). F.S. Roberts had shown that for a graph G with n vertices, box(G) ≤ and cub(G) ≤ . A minimum vertex cover of a graph G is a minimum cardinality subset S of the vertex set of G such that each edge of G has at least one endpoint in S. We show that box(G) ≤ +1 and cub(G)≤ t+ ⌈log2(n −t)⌉−1 where t is the cardinality of a minimum vertex cover. Both these bounds are tight. For a bipartite graph G, we show that box(G) ≤ and this bound is tight. We observe that there exist graphs of very high boxicity but with very low chromatic num-ber. For example, there exist bipartite (2 colorable) graphs with boxicity equal to . Interestingly, if boxicity is very close to , then the chromatic number also has to be very high. In particular, we show that if box(G) = −s, s ≥ 02, then x(G) ≥ where X(G) is the chromatic number of G. We also discuss some known techniques for findingan upper boundon the boxicityof a graph -representing the graph as the intersection of graphs with boxicity 1 (boxicity 1 graphs are known as interval graphs) and covering the complement of the graph by co-interval graphs (a co-interval graph is the complement of an interval graph).
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Cut vertex"

1

Edward, Lear. The owl and the pussy-cat. Trumpet Club, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Edward, Lear. The owl and the pussy cat went to sea: And other nonsense verse. Global Book Pub. Pty., 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Edward, Lear. The owl & the pussy-cat & other nonsense. Beehive, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Edward, Lear. The owl & the pussy-cat & other nonsense. Silver Burdett Co., 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Edward, Lear. The owl and the pussy-cat. Candlewick Press, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Lear, Edward. The owl and the pussy-cat. Clarion Books, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Lear, Edward. The owl and the pussy-cat. Harper & Row, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Edward, Lear. The owl and the pussy cat. Atheneum Books for Young Readers, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Edward, Lear. The owl and the pussy-cat. Clarion Books, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Edward, Lear. The owl and the pussy cat. Walker Books, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Cut vertex"

1

Rahimian, Fatemeh, Amir H. Payberah, Sarunas Girdzijauskas, and Seif Haridi. "Distributed Vertex-Cut Partitioning." In Distributed Applications and Interoperable Systems. Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-43352-2_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Changat, Manoj, Ferdoos Hossein Nezhad, and Peter F. Stadler. "Cut Vertex Transit Functions of Hypergraphs." In Algorithms and Discrete Applied Mathematics. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-67899-9_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Atas, Furkan, and Mehmet Burak Akgun. "Exploiting Vertex-Cut Partitioning in Distributed Graph Generation." In Studies in Computational Intelligence. Springer Nature Switzerland, 2025. https://doi.org/10.1007/978-3-031-82435-7_33.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

de Verdière, Éric Colin. "Shortest Cut Graph of a Surface with Prescribed Vertex Set." In Algorithms – ESA 2010. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-15781-3_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Sun, Rujun, Lufei Zhang, Zuoning Chen, and Ziyu Hao. "A Balanced Vertex Cut Partition Method in Distributed Graph Computing." In Intelligence Science and Big Data Engineering. Big Data and Machine Learning Techniques. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-23862-3_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Uchoa, Eduardo, and Marcus Poggi de Aragão. "Vertex-Disjoint Packing of Two Steiner Trees: Polyhedra and Branch-and-Cut." In Integer Programming and Combinatorial Optimization. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48777-8_33.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Benjamin, Bergougnoux, Charis Papadopoulos, and Jan Arne Telle. "Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width." In Graph-Theoretic Concepts in Computer Science. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-60440-0_31.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Wang, Jie, and Dagang Li. "SWR: Using Windowed Reordering to Achieve Fast and Balanced Heuristic for Streaming Vertex-Cut Graph Partitioning." In Algorithms and Architectures for Parallel Processing. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-38991-8_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Frishter, Lyudmila. "Photoelasticity-Based Study of Stress-Strain State in the Area of the Plain Domain Boundary Cut-Out Area Vertex." In International Scientific Conference Energy Management of Municipal Transportation Facilities and Transport EMMFT 2017. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-70987-1_89.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Dai, Qionghai, and Yue Gao. "Typical Hypergraph Computation Tasks." In Artificial Intelligence: Foundations, Theory, and Algorithms. Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-99-0185-2_5.

Full text
Abstract:
AbstractAfter hypergraph structure generation for the data, the next step is how to conduct data analysis on the hypergraph. In this chapter, we introduce four typical hypergraph computation tasks, including label propagation, data clustering, imbalance learning, and link prediction. The first typical task is label propagation, which is to predict the labels for the vertices, i.e., assigning a label to each unlabeled vertex in the hypergraph, based on the labeled information. In general cases, label propagation is to propagate the label information from labeled vertices to unlabeled vertices through structural information of the hyperedges. In this part, we discuss the hypergraph cut on hypergraphs and random walk interpretation of label propagation on hypergraphs. The second typical task is data clustering, which is formulated as dividing the vertices into several parts in a hypergraph. In this part, we introduce a hypergraph Laplacian smoothing filter and an embedded model for hypergraph clustering tasks. The third typical task is cost-sensitive learning, which targets on learning with different mis-classification costs. The fourth typical task is link prediction, which aims to discover missing relations or predict new coming hyperedges based on the observed hypergraph.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Cut vertex"

1

Zhou, Yangming, Zhibin Jiang, and MengChu Zhou. "Simulated Hill Climbing Search for the Solutions of k-Vertex Cut Problems." In 2024 IEEE 20th International Conference on Automation Science and Engineering (CASE). IEEE, 2024. http://dx.doi.org/10.1109/case59546.2024.10711754.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Diesel, Adilson Luiz, Eugenio Jose Agrizzi, and Giovanna Cypriano Lage. "A FORÇA DO CINTURÃO VERDE NO DESEMPENHO AMBIENTAL DA CST." In 36º Seminário de Fusão, Refino e Solidificação dos Metais - Internacional. Editora Blucher, 2005. https://doi.org/10.5151/2594-5300-2004-13872-0058.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Mykhailenko, Hlib, Giovanni Neglia, and Fabrice Huet. "Which metrics for vertex-cut partitioning?" In 2016 11th International Conference for Internet Technology and Secured Transactions (ICITST). IEEE, 2016. http://dx.doi.org/10.1109/icitst.2016.7856670.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Kashyap, Navin. "The Vertex-Cut Bound and its applications." In 2008 International Symposium on Information Theory and Its Applications (ISITA). IEEE, 2008. http://dx.doi.org/10.1109/isita.2008.4895506.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Sajjad, Hooman Peiro, Amir H. Payberah, Fatemeh Rahimian, Vladimir Vlassov, and Seif Haridi. "Boosting Vertex-Cut Partitioning for Streaming Graphs." In 2016 IEEE International Congress on Big Data (BigData Congress). IEEE, 2016. http://dx.doi.org/10.1109/bigdatacongress.2016.10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Jiang, Yonggang, and Sagnik Mukhopadhyay. "Finding a Small Vertex Cut on Distributed Networks." In STOC '23: 55th Annual ACM Symposium on Theory of Computing. ACM, 2023. http://dx.doi.org/10.1145/3564246.3585201.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Kandappan, Malathy, and Meenakshi Subramanian. "Minimum total dominating energy of cut vertex graphs." In ADVANCES IN SUSTAINABLE CONSTRUCTION MATERIALS. AIP Publishing, 2023. http://dx.doi.org/10.1063/5.0120710.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Ugurlu, Onur, Murat Ersen Berberler, Gozde Kizilates, and Mehmet Kurt. "New algorithm for finding minimum vertex cut set." In 2012 IV International Conference "Problems of Cybernetics and Informatics" (PCI). IEEE, 2012. http://dx.doi.org/10.1109/icpci.2012.6486470.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Rad, Hadis Cheraghzade, and Reza Azmi. "CLDA: Vertex-cut partitioning for streaming power-law graphs." In 2017 9th International Conference on Information and Knowledge Technology (IKT). IEEE, 2017. http://dx.doi.org/10.1109/ikt.2017.8258626.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Beseri Sevim, Tina, Hakan Kutucu, and Murat Ersen Berberler. "New mathematical model for finding minimum vertex cut set." In 2012 IV International Conference "Problems of Cybernetics and Informatics" (PCI). IEEE, 2012. http://dx.doi.org/10.1109/icpci.2012.6486469.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Cut vertex"

1

Mueller, C., S. J. Piercey, M. G. Babechuk, and D. Copeland. Stratigraphy and lithogeochemistry of the Goldenville horizon and associated rocks, Baie Verte Peninsula, Newfoundland. Natural Resources Canada/CMSS/Information Management, 2021. http://dx.doi.org/10.4095/328990.

Full text
Abstract:
The Goldenville horizon in the Baie Verte Peninsula is an important stratigraphic horizon that hosts primary (Cambrian to Ordovician) exhalative magnetite and pyrite and was a chemical trap for younger (Silurian to Devonian) orogenic gold mineralization. The horizon is overlain by basaltic flows and volcaniclastic rocks, is intercalated with variably coloured argillites and cherts, and underlain by mafic volcaniclastic rocks; the entire stratigraphy is cut by younger fine-grained mafic dykes and coarser gabbro. Lithogeochemical signatures of the Goldenville horizon allow it to be divided into high-Fe iron formation (HIF; &amp;amp;gt;50% Fe2O3), low-Fe iron formation (LIF; 15-50% Fe2O3), and argillite with iron minerals (AIF; &amp;amp;lt;15% Fe2O3). These variably Fe-rich rocks have Fe-Ti-Mn-Al systematics consistent with element derivation from varying mineral contributions from hydrothermal venting and ambient detrital sedimentation. Post-Archean Australian Shale (PAAS)-normalized rare earth element (REE) signatures for the HIF samples have negative Ce anomalies and patterns similar to modern hydrothermal sediment deposited under oxygenated ocean conditions. The PAAS-normalized REE signatures of LIF samples have positive Ce anomalies, similar to hydrothermal sediment deposited under anoxic to sub-oxic conditions. The paradoxical Ce behaviour is potentially explained by the Mn geochemistry of the LIF samples. The LIF have elevated MnO contents (2.0-7.5 weight %), suggesting that Mn from hydrothermal fluids was oxidized in an oxygenated water column during hydrothermal venting, Mn-oxides then scavenged Ce from seawater, and these Mn-oxides were subsequently deposited in the hydrothermal sediment. The Mn-rich LIF samples with positive Ce anomalies are intercalated with HIF with negative Ce anomalies, both regionally and on a metre scale within drill holes. Thus, the LIF positive Ce anomaly signature may record extended and particle-specific scavenging rather than sub-oxic/redox-stratified marine conditions. Collectively, results suggest that the Cambro-Ordovician Taconic seaway along the Laurentian margin may have been completely or near-completely oxygenated at the time of Goldenville horizon deposition.
APA, Harvard, Vancouver, ISO, and other styles
2

Pilote, J. L., S. J. Piercey, and P. Mercier-Langevin. Stratigraphy and hydrothermal alteration of the Ming Cu-Au volcanogenic massive-sulphide deposit, Baie Verte Peninsula, Newfoundland. Natural Resources Canada/ESS/Scientific and Technical Publishing Services, 2014. http://dx.doi.org/10.4095/295145.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Pilote, J. L., and S. J. Piercey. Volcanostratigraphy of the 1807 zone of the Ming Cu-Au volcanogenic massive-sulphide deposit, Baie Verte Peninsula, northern Newfoundland. Natural Resources Canada/ESS/Scientific and Technical Publishing Services, 2013. http://dx.doi.org/10.4095/293128.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Pilote, J. L., S. J. Piercey, and P. Mercier-Langevin. Volcanic architecture and alteration assemblages of the Ming Cu-Au-(Zn-Ag) VMS deposit, Baie Verte, Newfoundland and Labrador: implications for Au-enrichment processes and exploration. Natural Resources Canada/ESS/Scientific and Technical Publishing Services, 2015. http://dx.doi.org/10.4095/296553.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Cai, Manlin, Donna Lero, and Sylvia Fuller. Expose de politiques : Politiques soins/travail pour une gestion des soins quotidiens et des soins imprévisibles. L’Institut Vanier de la famille, 2025. https://doi.org/10.61959/esnt2797f.

Full text
Abstract:
Les parents de jeunes enfants qui ont un emploi sont appelés à gérer un éventail de responsabilités liées aux soins quotidiens. Celles-ci peuvent être prévisibles, comme le fait d’aller reconduire ou chercher les enfants à l’école ou au service de garde, ou imprévisibles, comme les soins à donner à un enfant malade ou la gestion de perturbations liées à la garde des enfants. Les politiques soins/travail, notamment les modalités de travail flexibles, les congés liés aux responsabilités familiales et les congés de maladie, jouent un rôle fondamental en permettant aux parents et autres personnes aidantes de répondre à de multiples besoins. Cet exposé de politique propose une analyse des réglementations en vigueur relatives aux principaux droits en matière d’emploi, en ce qui a trait aux responsabilités quotidiennes des personnes aidantes, en vertu du Code canadien du travail et des normes d’emploi provinciales et territoriales. Il se base également sur les données de l’Enquête canadienne sur l’apprentissage et la garde des jeunes enfants de 2023, afin d’examiner dans quelle mesure les parents ont accès à des dispositions favorables à leur rôle de soins. L’analyse montre que l’accès à des congés et à des modalités de travail flexibles est limité, inégal et inéquitable. Afin de permettre aux parents au Canada de concilier efficacement emploi et responsabilités de soins, il est essentiel d’assurer un accès plus complet et équitable à de telles formules.
APA, Harvard, Vancouver, ISO, and other styles
6

Anderson, Zachary W., Greg N. McDonald, Elizabeth A. Balgord, and W. Adolph Yonkee. Interim Geologic Map of the Browns Hole Quadrangle, Weber and Cache Counties, Utah. Utah Geological Survey, 2023. http://dx.doi.org/10.34191/ofr-760.

Full text
Abstract:
The Browns Hole quadrangle is in Weber and Cache Counties of northern Utah and covers the eastern part of Ogden Valley, a rapidly developing area of the Wasatch Range. The Middle and South Forks of the Ogden River bisect the quadrangle and are important watersheds and recreational areas to the communities of Ogden Valley and the Wasatch Front. The towns of Huntsville and Eden are just west of the quadrangle, unincorporated communities with year-round residents are present throughout the quadrangle, and numerous summer-cabin communities are present in the eastern part of the quadrangle. A portion of Powder Mountain ski resort, which draws year-round visitation and recreation, is present in the northwest corner of the quadrangle. The quadrangle contains the Willard thrust, a major thrust fault with approximately 30 mi (50 km) of eastward displacement that was active during the Cretaceous-Eocene Sevier orogeny (Yonkee and others, 2019). In the quadrangle, the Willard thrust places Neoproterozoic through Ordovician strata in the hanging wall over a fault-bounded lozenge of Cambrian strata and footwall Jurassic and Triassic strata (see cross section on Plate 2). Neoproterozoic strata comprise a succession of mostly clastic rocks deposited during rifting of western North America and breakup of the supercontinent Rodinia (Yonkee and others, 2014). These rocks include the Cryogenian-age Perry Canyon and Maple Canyon Formations, and the Ediacaran-age Kelley Canyon Formation, Papoose Creek Formation, Caddy Canyon Quartzite, Inkom Formation, Mutual Formation, and Browns Hole Formation. The Browns Hole Formation is a sequence of interbedded volcaniclastic rock and basalt lava flows that provides the only radiometric age control in the quadrangle. Provow and others (2021) reported a ~610 Ma detrital apatite U-Pb age from volcaniclastic sandstone at the base of the formation, Crittenden and Wallace (1973) reported a 580 ± 14 Ma K-Ar hornblende age for a volcanic clast, and Verdel (2009) reported a 609 ± 25 Ma U-Pb apatite age for a basalt flow near the top of the formation. Cambrian strata in the hanging wall include a thick basal clastic sequence (Geertsen Canyon Quartzite) overlain by a thick sequence of interbedded limestone, shale, and dolomite (Langston, Ute, and Blacksmith Formations). Hanging wall rocks are deformed by Willard thrust-related structures, including the Browns Hole anticline, Maple Canyon thrust, and numerous smaller folds and minor faults. Footwall rocks of the Willard thrust include highly deformed Cambrian strata within a fault-bounded lozenge exposed in the southern part of the quadrangle, and Jurassic and Triassic rocks exposed just south of the quadrangle. The Paleocene-Eocene Wasatch Formation unconformably overlies older rocks and was deposited over considerable paleotopography developed during late stages of the Sevier orogeny. The southwest part of the quadrangle is cut by a southwest-dipping normal fault system that bounds the east side of Ogden Valley. This fault is interpreted to have experienced an early phase of slip during local late Eocene to Oligocene collapse of the Sevier belt and deposition of volcanic and volcaniclastic rocks (Norwood Tuff) exposed west of the quadrangle (Sorensen and Crittenden, 1979), and a younger phase of slip during Neogene Basin and Range extension (Zoback, 1983). Lacustrine deposits and shorelines of Pleistocene-age Lake Bonneville are present in the southwest corner of the quadrangle near the mouth of the South Fork of the Ogden River and record the highstand of Lake Bonneville (Oviatt, 2015). Pleistocene glacial deposits, present in the northwest corner of the map, are likely related to the Pinedale glaciation, commonly expressed by two moraine building episodes in the Wasatch Range (Quirk and others, 2020). Numerous incised alluvial deposits and geomorphic surfaces are present along major drainages and record pre- and post-Lake Bonneville aggradational and degradational alluvial and colluvial sequences. Mass-movement deposits, including historically active landslides, are present throughout the quadrangle. Crittenden (1972) mapped the Browns Hole quadrangle at 1:24,000 scale, which provided an excellent foundation for the general stratigraphy and structure, but the 1972 map lacked important details of unconsolidated surficial units. As part of 1:62,500 scale mapping of the Ogden 30'x60' quadrangle, Coogan and King (2016) updated stratigraphic nomenclature, revised some contacts, and added more details for surficial units. For this map, we utilized new techniques for data acquisition and analysis to delineate surficial deposits, bedrock contacts, and faults more accurately and precisely. Mapping and field data collection were largely done in 2021–2022 using a combination of GPS-enabled tablets equipped with georectified aerial imagery (U.S. Department of Agriculture [USDA] National Agriculture Imagery Program [NAIP], 2009), orthoimagery (Utah Geospatial Resource Center [UGRC] State Geographic Information Database, 2018b, 2018c; 2021a, 2021b), and lidar data (UGRC State Geographic Information Database, 2006; 2011; 2013–2014; 2018a), previously published geologic maps, topographic maps, and applications for digital attitude collection. We also used hand-held GPS units, Brunton compasses, and field notebooks to collect geologic data. Field data were transferred to a Geographic Information System (GIS), where the map was compiled and completed.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Cut vertex' for particular source types:
Journal articles Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography