Log in

Relevant bibliographies by topics / Bridges (Graph theory)

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers

Academic literature on the topic 'Bridges (Graph theory)'

Author: Grafiati

Published: 4 June 2021

Last updated: 3 February 2022

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 'Bridges (Graph theory).'

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 "Bridges (Graph theory)"

1

McDIARMID, COLIN, and KERSTIN WELLER. "Bridge-Addability, Edge-Expansion and Connectivity." Combinatorics, Probability and Computing 26, no. 5 (2017): 697–719. http://dx.doi.org/10.1017/s0963548317000128.

Full text

Abstract:

A class of graphs is calledbridge-addableif, for each graph in the class and each pairuandvof vertices in different components, the graph obtained by adding an edge joininguandvmust also be in the class. The concept was introduced in 2005 by McDiarmid, Steger and Welsh, who showed that, for a random graph sampled uniformly from such a class, the probability that it is connected is at least 1/e.We generalize this and related results to bridge-addable classes with edge-weights which have an edge-expansion property. Here, a graph is sampled with probability proportional to the product of its edge

APA, Harvard, Vancouver, ISO, and other styles

2

Khan, Sami Ullah, Naeem Jan, Kifayat Ullah, and Lazim Abdullah. "Graphical Structures of Cubic Intuitionistic Fuzzy Information." Journal of Mathematics 2021 (May 11, 2021): 1–21. http://dx.doi.org/10.1155/2021/9994977.

Full text

Abstract:

The theory developed in this article is based on graphs of cubic intuitionistic fuzzy sets (CIFS) called cubic intuitionistic fuzzy graphs (CIFGs). This graph generalizes the structures of fuzzy graph (FG), intuitionistic fuzzy graph (IFG), and interval-valued fuzzy graph (IVFG). Moreover, several associated concepts are established for CIFG, such as the idea subgraphs, degree of CIFG, order of CIFG, complement of CIFG, path in CIFG, strong CIFG, and the concept of bridges for CIFGs. Furthermore, the generalization of CIFG is proved with the help of some remarks. In addition, the comparison am

APA, Harvard, Vancouver, ISO, and other styles

3

Zhang, Yunkai, Qingli Xie, Guohua Li, and Yali Liu. "Multi-Damage Identification of Multi-Span Bridges Based on Influence Lines." Coatings 11, no. 8 (2021): 905. http://dx.doi.org/10.3390/coatings11080905.

Full text

Abstract:

The framework security of a bridge is essential as a critical component of traffic engineering. Even though the bridge structure is damaged to various degrees due to various reasons, the bridge will be wrecked when the damage reaches a particular level, suggesting a negative influence on people’s lives. Based on the current situation and existing problems of structural damage identification of bridges, a structural damage identification technology of continuous beam bridges based on deflection influence lines is proposed in this paper in order to keep track of and always detect broken bridge e

APA, Harvard, Vancouver, ISO, and other styles

4

Naumowicz, Adam. "A Note on the Seven Bridges of Königsberg Problem." Formalized Mathematics 22, no. 2 (2014): 177–78. http://dx.doi.org/10.2478/forma-2014-0018.

Full text

Abstract:

Summary In this paper we account for the formalization of the seven bridges of Königsberg puzzle. The problem originally posed and solved by Euler in 1735 is historically notable for having laid the foundations of graph theory, cf. [7]. Our formalization utilizes a simple set-theoretical graph representation with four distinct sets for the graph’s vertices and another seven sets that represent the edges (bridges). The work appends the article by Nakamura and Rudnicki [10] by introducing the classic example of a graph that does not contain an Eulerian path. This theorem is item #54 from the “Fo

APA, Harvard, Vancouver, ISO, and other styles

5

Sanli, Utkum, Feriha Celik, Sadik Delen, and Ismail Cangul. "Connectedness criteria for graphs by means of omega invariant." Filomat 34, no. 2 (2020): 647–52. http://dx.doi.org/10.2298/fil2002647s.

Full text

Abstract:

A realizable degree sequence can be realized in many ways as a graph. There are several tests for determining realizability of a degree sequence. Up to now, not much was known about the common properties of these realizations. Euler characteristic is a well-known characteristic of graphs and their underlying surfaces. It is used to determine several combinatorial properties of a surface and of all graphs embedded onto it. Recently, last two authors defined a number ? which is invariant for all realizations of a given degree sequence. ? is shown to be related to Euler characteristic and cycloma

APA, Harvard, Vancouver, ISO, and other styles

6

MATIGNON, DANIEL. "COMBINATORICS AND FOUR BRIDGED KNOTS." Journal of Knot Theory and Its Ramifications 10, no. 04 (2001): 493–527. http://dx.doi.org/10.1142/s0218216501000974.

Full text

Abstract:

The ℝ P 3-Conjecture states a non-trivial knot in S 3 cannot yield ℝ P 3 by a Dehn surgery. Generically, in the knot-space S3-N(K), the intersection of a projective plane ℝP2 in ℝ P 3, and any 2-sphere S2 in S3 pierced by K, is a 1-complex which can be viewed as a graph in either the projective plane or the 2-sphere. Gordon and Luecke have used similar graphs arising as the intersection of two 2-spheres, to prove that a knot in S3 is determined by its complement. A part of this paper concerns some new combinatorial results on these graphs. They are considered as an unavoidable step towards sho

APA, Harvard, Vancouver, ISO, and other styles

7

Sheng, Gui Lin, Shao Chun Ma, and Peng Bao. "Visual Safety Evaluation of Bridges Based on the Straight Lines Failure Envelope Theory." Applied Mechanics and Materials 256-259 (December 2012): 1528–32. http://dx.doi.org/10.4028/www.scientific.net/amm.256-259.1528.

Full text

Abstract:

The paper deduced visual safety evaluation models in each layer under the action of internal forces for the pole bracing system of bridge structure ,based on failure envelope theory. It calculated and analyzed the actual Xugou especially big bridge project with these evaluation methods. Analyzed visibility graph of bridge structure, tried to find out directly concrete distribution and the safety degree of structure on visible group points in intra-regional each point to corresponding coordinateof octahedral failure envelope. It can finally realize quantitative and visual safety assessment for

APA, Harvard, Vancouver, ISO, and other styles

8

Fasmer, Ole Bernt, Erlend Eindride Fasmer, Kristin Mjeldheim, et al. "Diurnal variation of motor activity in adult ADHD patients analyzed with methods from graph theory." PLOS ONE 15, no. 11 (2020): e0241991. http://dx.doi.org/10.1371/journal.pone.0241991.

Full text

Abstract:

Attention-deficit /hyperactivity disorder (ADHD) is a common neurodevelopmental syndrome characterized by age-inappropriate levels of motor activity, impulsivity and attention. The aim of the present study was to study diurnal variation of motor activity in adult ADHD patients, compared to healthy controls and clinical controls with mood and anxiety disorders. Wrist-worn actigraphs were used to record motor activity in a sample of 81 patients and 30 healthy controls. Time series from registrations in the morning and evening were analyzed using measures of variability, complexity and a newly de

APA, Harvard, Vancouver, ISO, and other styles

9

Lu, Yi, Zhonghua Gou, Yu Ye, and Qiang Sheng. "Three-dimensional visibility graph analysis and its application." Environment and Planning B: Urban Analytics and City Science 46, no. 5 (2017): 948–62. http://dx.doi.org/10.1177/2399808317739893.

Full text

Abstract:

Graph-based visibility analysis, developed from space syntax and social network theory, embraces mutual visibility between locations in a spatial system. It helps designers and researchers to decode spatial cognition and behavior, but methodological constraints limit its application to two-dimensional floor plans. In this study, we propose a new visibility graph analysis that can be used in three-dimensional built environments, such as multilevel atrium buildings or urban environments with canopies or overpass bridges. Furthermore, we draw a distinction between a generic visibility graph and a

APA, Harvard, Vancouver, ISO, and other styles

10

Bonnaire, Tony, Nabila Aghanim, Aurélien Decelle, and Marian Douspis. "T-ReX: a graph-based filament detection method." Astronomy & Astrophysics 637 (May 2020): A18. http://dx.doi.org/10.1051/0004-6361/201936859.

Full text

Abstract:

Numerical simulations and observations show that galaxies are not uniformly distributed in the universe but, rather, they are spread across a filamentary structure. In this large-scale pattern, highly dense regions are linked together by bridges and walls, all of them surrounded by vast, nearly-empty areas. While nodes of the network are widely studied in the literature, simulations indicate that half of the mass budget comes from a more diffuse part of the network, which is made up of filaments. In the context of recent and upcoming large galaxy surveys, it becomes essential that we identify

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Bridges (Graph theory)"

1

Kundu, Madan Gopal. "Advanced Modeling of Longitudinal Spectroscopy Data." Thesis, 2014. http://hdl.handle.net/1805/5454.

Full text

Abstract:

Indiana University-Purdue University Indianapolis (IUPUI)<br>Magnetic resonance (MR) spectroscopy is a neuroimaging technique. It is widely used to quantify the concentration of important metabolites in a brain tissue. Imbalance in concentration of brain metabolites has been found to be associated with development of neurological impairment. There has been increasing trend of using MR spectroscopy as a diagnosis tool for neurological disorders. We established statistical methodology to analyze data obtained from the MR spectroscopy in the context of the HIV associated neurological disorder. F

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Bridges (Graph theory)"

1

Cycles and bridges in graphs. Kluwer Academic Publishers, 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Kalinichenko, Evgeny. Theory and methods for calculating the inertial-braking characteristics of a ship. «Scientific Route» OÜ, 2020. http://dx.doi.org/10.21303/978-617-7319-30-5.

Full text

Abstract:

One of the most serious problems of modern navigation is the accident rate that occurs due to inept or belated maneuvering of ships. As a result of accidents in the world, more than 200 ships die every year and every fourth receives significant damage. Full-scale tests show that the stopping distance of large-tonnage ships turn out to be much less permissible, and shipbuilders are able to significantly reduce the astern power of such ships, making them cheaper at the expense of safety. The low accuracy of inertial-braking characteristics is mainly due to unqualified field tests. Analysis of gr

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Bridges (Graph theory)"

1

Bonnington, C. Paul, and Charles H. C. Little. "Bridges." In The Foundations of Topological Graph Theory. Springer New York, 1995. http://dx.doi.org/10.1007/978-1-4612-2540-9_10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Italiano, Giuseppe F. "Strong Bridges and Strong Articulation Points of Directed Graphs." In SOFSEM 2012: Theory and Practice of Computer Science. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-27660-6_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Matta, Chérif F., Ismat Sumar, Ronald Cook, and Paul W. Ayers. "Localization-Delocalization Matrices and Electron Density-Weighted Adjacency/Connectivity Matrices: A Bridge Between the Quantum Theory of Atoms in Molecules and Chemical Graph Theory." In Challenges and Advances in Computational Chemistry and Physics. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-29022-5_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Wilson, Robin. "6. Graphs." In Combinatorics: A Very Short Introduction. Oxford University Press, 2016. http://dx.doi.org/10.1093/actrade/9780198723493.003.0006.

Full text

Abstract:

Graph theory is about collections of points that are joined in pairs, such as a road map with towns connected by roads or a molecule with atoms joined by chemical bonds. ‘Graphs’ revisits the Königsberg bridges problem, the knight’s tour problem, the Gas–Water–Electricity problem, the map-colour problem, the minimum connector problem, and the travelling salesman problem and explains how they can all be considered as problems in graph theory. It begins with an explanation of a graph and describes the complete graph, the complete bipartite graph, and the cycle graph, which are all simple graphs. It goes on to describe trees in graph theory, Eulerian and Hamiltonian graphs, and planar graphs.

APA, Harvard, Vancouver, ISO, and other styles

5

Voss, H. J. "Bridges of Longest Circuits Applied to the Circumference of Regular Graphs." In Graph Theory in Memory of G.A. Dirac. Elsevier, 1988. http://dx.doi.org/10.1016/s0167-5060(08)70481-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Alekseyev, Max A., and Gérard P. Michon. "Making Walks Count: From Silent Circles to Hamiltonian Cycles." In The Mathematics of Various Entertaining Subjects. Princeton University Press, 2017. http://dx.doi.org/10.23943/princeton/9780691171920.003.0010.

Full text

Abstract:

Leonhard Euler (1707–1783) invented graph theory in 1735, by solving a puzzle of interest to the inhabitants of Königsberg. The city comprised three distinct land masses, connected by seven bridges. The residents sought a walk through the city that crossed each bridge exactly once but were consistently unable to find one. Euler showed that such a puzzle would have a solution if and only if every land mass was at the origin of an even number of bridges, with at most two exceptions—which could only be at the start or the end of the journey. Modern treatments of the problem capture Euler's reasoning by employing a diagram in which the land masses are represented by dots (called nodes), while the bridges are represented by line segments connecting the nodes (called edges). Such a diagram is referred to as a graph. This chapter uses algebraic graph theory to solve a number of counting problems.

APA, Harvard, Vancouver, ISO, and other styles

7

D'Agostino, Susan. "Walk through the problem, as on the Konigsberg bridges." In How to Free Your Inner Mathematician. Oxford University Press, 2020. http://dx.doi.org/10.1093/oso/9780198843597.003.0011.

Full text

Abstract:

“Walk through the problem, as on the Konigsberg bridges” offers an introduction to the mathematical subfield of graph theory, including its origin in Konigsberg, Prussia—now Kaliningrad, Russia. When townspeople were unable to identify a path that started in one place, crossed all seven of their city’s bridges once, and returned to the same place, they enlisted the help of mathematician Leonard Euler. In response, Euler developed a “geometry of position”—now known as “graph theory”—which concerned not distance, measurements, or angles, but arrangement. The discussion is supplemented with numerous hand-drawn sketches and mention of real-life applications of graph theory in technology, disease modeling, neuroscience, and social media. Mathematics students and enthusiasts are encouraged to “walk through” their own problems in mathematics and life. At the chapter’s end, readers may check their understanding by working on a problem. A solution is provided.

APA, Harvard, Vancouver, ISO, and other styles

8

Benjamin, Arthur, Gary Chartrand, and Ping Zhang. "Analyzing Distance." In The Fascinating World of Graph Theory. Princeton University Press, 2017. http://dx.doi.org/10.23943/princeton/9780691175638.003.0003.

Full text

Abstract:

This chapter considers distance in graphs, first by providing an overview of some fundamental concepts in graph theory. In particular, it discusses connected graphs, cut-vertex and bridge, and bipartite graphs. It then addresses questions of the distance between locations in a graph and those locations that are far from or close to a given location. It also looks at dominating sets in graphs, focusing on the Five Queens Problem/Puzzle and the Lights Out Puzzle, before concluding with an analysis of the rather humorous concept of Erdős numbers, conceptualized by Hungarian mathematician Paul Erdős. According to this concept, for each mathematician A, the Erdős number of A is the distance from A to Erdős in the collaboration graph. Consequently, Erdős is the only mathematician with the Erdős number 0, whereas any mathematician who has coauthored a paper with Erdős has Erdős number 1.

APA, Harvard, Vancouver, ISO, and other styles

9

Iranpoor, Mehdi, and Davood Mohammaditabar. "Eulerian Trails and Tours." In Graph Theory for Operations Research and Management. IGI Global, 2013. http://dx.doi.org/10.4018/978-1-4666-2661-4.ch007.

Full text

Abstract:

When L. Euler used a representation of vertices and edges to explain a legend about the existence of a route that someone could cross each bridge of Konigsberg city exactly once and go back to the origin, he actually developed the graph theory. This new theory was found useful in explaining many problems. Then, theorems about the existence of such Euler tours that cross each edge of a graph exactly once were introduced. These theorems show that there should be some conditions for a graph to posses such a tour which in simple graphs is to be connected and even. Also, other definitions and applications of Euler tours in cases where the tour is not closed or the graph is directed were developed. Euler tours have many real world applications, and therefore, some polynomial time algorithms are developed to find such tours in graphs.

APA, Harvard, Vancouver, ISO, and other styles

10

Benjamin, Arthur, Gary Chartrand, and Ping Zhang. "Graph Theory: A Look Back—The Road Ahead." In The Fascinating World of Graph Theory. Princeton University Press, 2017. http://dx.doi.org/10.23943/princeton/9780691175638.003.0013.

Full text

Abstract:

This book concludes with an epilogue, which traces the evolution of graph theory, from the conceptualization of the Königsberg Bridge Problem and its generalization by Leonhard Euler, whose solution led to the subject of Eulerian graphs, to the various efforts to solve the Four Color Problem. It considers elements of graph theory found in games and puzzles of the past, and the famous mathematicians involved including Sir William Rowan Hamilton and William Tutte. It also discusses the remarkable increase since the 1960s in the number of mathematicians worldwide devoted to graph theory, along with research journals, books, and monographs that have graph theory as a subject. Finally, it looks at the growth in applications of graph theory dealing with communication and social networks and the Internet in the digital age and the age of technology.

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Bridges (Graph theory)"

1

Sosa, Manuel E., Anupam Agrawal, Steven D. Eppinger, and Craig M. Rowles. "A Network Approach to Define Modularity of Product Components." In ASME 2005 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2005. http://dx.doi.org/10.1115/detc2005-85422.

Full text

Abstract:

We consider complex products as a network of components that share technical interfaces in order to function as a whole. Building upon previous work in graph theory and social network analysis, we define three measures of component modularity that consider how components may share direct interfaces with other adjacent components, how design interfaces may propagate to all other components in the product, and how components may act as “bridges” between other components. We calculate and interpret all three measures of component modularity by studying the actual product architecture of a large c

APA, Harvard, Vancouver, ISO, and other styles

2

Zhou, Zhenxu, Hao Nie, Chunling Dong, and Qin Zhang. "Safety Analysis Model of DUCG Based on FMEA/FTA." In 2018 26th International Conference on Nuclear Engineering. American Society of Mechanical Engineers, 2018. http://dx.doi.org/10.1115/icone26-81484.

Full text

Abstract:

Failure Modes and Effects Analysis (FMEA) is a useful tool to find possible flaws, to reduce cost and to shorten research cycle in complex industrial systems. Fault Tree Analysis (FTA) has gained credibility over the past years, not only in nuclear industry, but also in other industries like aerospace, petrochemical, and weapon. Both FMEA and FTA are effective techniques in safety analysis, but there are still many uncertain factors in them that are not well addressed until now. This paper combines FMEA and FTA based on Dynamic Uncertain Causality Graph (DUCG) to solve this issue. Firstly, the

APA, Harvard, Vancouver, ISO, and other styles

3

Guo, Lei, Li Tang, Tong Chen, Lei Zhu, Quoc Viet Hung Nguyen, and Hongzhi Yin. "DA-GCN: A Domain-aware Attentive Graph Convolution Network for Shared-account Cross-domain Sequential Recommendation." In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/342.

Full text

Abstract:

Shared-account Cross-domain Sequential Recommendation (SCSR) is the task of recommending the next item based on a sequence of recorded user behaviors, where multiple users share a single account, and their behaviours are available in multiple domains. Existing work on solving SCSR mainly relies on mining sequential patterns via RNN-based models, which are not expressive enough to capture the relationships among multiple entities. Moreover, all existing algorithms try to bridge two domains via knowledge transfer in the latent space, and the explicit cross-domain graph structure is unexploited.

APA, Harvard, Vancouver, ISO, and other styles

4

Lou, Kuiyang, Subramaniam Jayanti, Natraj Iyer, Yagnanarayanan Kalyanaraman, Sunil Prabhakar, and Karthik Ramani. "A Reconfigurable 3D Engineering Shape Search System: Part II — Database Indexing, Retrieval, and Clustering." In ASME 2003 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2003. http://dx.doi.org/10.1115/detc2003/cie-48188.

Full text

Abstract:

This paper introduces database and related techniques for a reconfigurable, intelligent 3D engineering shape search system, which retrieves similar 3D models based on their shape content. Feature vectors, which are numeric “fingerprints” of 3D models, and skeletal graphs, which are the “minimal representations of the shape content” of a 3D model, represent the shape content. The Euclidean distance of the feature vectors, as well as the distance between skeletal graphs, provides indirect measures of shape similarity between the 3D models. Critical database issues regarding 3D shape search syste

APA, Harvard, Vancouver, ISO, and other styles

5

Masoudi, Ramin, Stephen Birkett, and John McPhee. "Dynamic Model of a Vertical Piano Action Mechanism." In ASME 2009 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2009. http://dx.doi.org/10.1115/detc2009-87680.

Full text

Abstract:

The dynamic behavior of a vertical piano action mechanism is studied using a simulation model and compared qualitatively to observations obtained by high-speed imaging of a real action. The simulated response of all components is obtained for two different prescribed input force profiles applied at the key front. These inputs represent in simplified form the general shape of a typical force input by a pianist measured at the key surface for a strong (forte) strike, or two key strikes in rapid succession. The graph-theoretic multibody model constructed represents the components and their intera

APA, Harvard, Vancouver, ISO, and other styles

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!