Log in

Relevant bibliographies by topics / Eulerian graph theory

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers

Academic literature on the topic 'Eulerian graph theory'

Author: Grafiati

Published: 4 June 2021

Last updated: 31 July 2024

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 'Eulerian 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 "Eulerian graph theory"

1

Metsidik, Metrose. "Eulerian and Even-Face Graph Partial Duals." Symmetry 13, no. 8 (2021): 1475. http://dx.doi.org/10.3390/sym13081475.

Full text

Abstract:

Eulerian and bipartite graph is a dual symmetric concept in Graph theory. It is well-known that a plane graph is Eulerian if and only if its geometric dual is bipartite. In this paper, we generalize the well-known result to embedded graphs and partial duals of cellularly embedded graphs, and characterize Eulerian and even-face graph partial duals of a cellularly embedded graph by means of half-edge orientations of its medial graph.

APA, Harvard, Vancouver, ISO, and other styles

2

Jafari, Hossein, Elham Bakhsheshi, and Amir-Reza Feizi-Derakhshi. "Presenting a Mathematical Programming Model for Discovering Eulerian Paths (EP) in Certain Specific Graphs." International Journal of Innovation in Engineering 3, no. 2 (2023): 1–7. http://dx.doi.org/10.59615/ijie.3.2.1.

Full text

Abstract:

In the modern era, graph theory is considered a useful tool for quantification and simplification of various dynamic components in complex systems. By representing elements as nodes and their connections as edges, graph theory can transform anything from urban planning to computer data into a meaningful mathematical language. Nowadays, numerous practical applications have been designed and developed based on graph theory. Graph theory is a branch of discrete mathematics that aims to describe and solve problems with discrete structures using points and edges. One of the problems concerning grap

APA, Harvard, Vancouver, ISO, and other styles

3

Prajapati, Rajeshri, Amit Parikh, and Pradeep Jha. "Exploring Novel Edge Connectivity in Graph Theory and its Impact on Eulerian Line Graphs." International Journal of Science and Research (IJSR) 12, no. 11 (2023): 1515–19. http://dx.doi.org/10.21275/sr231120155230.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Bae, Yeolhui, Yugyeom Yi, Jeongmoo Lee, and Sungmo Kang. "Research on Definition of BLL Graphs of Knot Diagrams and its Applications." Korean Science Education Society for the Gifted 14, no. 3 (2022): 229–36. http://dx.doi.org/10.29306/jseg.2022.14.3.229.

Full text

Abstract:

This paper is the research on the Knot theory in Topology. A knot is a simple closed curve in ℝ and its projection onto a plane in ℝ is called a knot projection. As the results of this paper we define a BLL(Bidirectional Linear Link) graph for a knot projection which is a bidirectional linear link representing the relations between arcs of a knot projection and obtain some properties of the BLL graphs. We also define an Eulerian cycle of the BLL graph and an Eulerian cycle of a knot projection. As the main results of this paper, we obtain the equivalent conditions of being an alternation knot

APA, Harvard, Vancouver, ISO, and other styles

5

Pandey, Ambrish Kr, and Shriya Kanchan. "Usage of Eulerian and Hamiltonian Graph in Pandemic Situation." Journal of Applied Science and Education (JASE) 1, no. 1 (2021): 1–8. http://dx.doi.org/10.54060/jase/001.01.002.

Full text

Abstract:

The existence of Euler and Hamiltonian graph make it easier to solve a real-life problem. During the time of pandemic “Covid-19”, it is very essential for each one of us to be vaccinated. Vaccination is done in the hospitals by using Eulerian and Hamiltonian graphs not only to prevent people from infecting but also to increase the speed of vaccination. In this paper, the authors have discussed the use of graph theory to effectively handle the covid – 19 pandemic situations in the allocation of patients to appropriate hospitals. The work done in this paper may be utilized for the hospital–patie

APA, Harvard, Vancouver, ISO, and other styles

6

Caravelli, Francesco, Michael Saccone, and Cristiano Nisoli. "On the degeneracy of spin ice graphs, and its estimate via the Bethe permanent." Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 477, no. 2252 (2021): 20210108. http://dx.doi.org/10.1098/rspa.2021.0108.

Full text

Abstract:

The concept of spin ice can be extended to a general graph. We study the degeneracy of spin ice graph on arbitrary interaction structures via graph theory. We map spin ice graphs to the Ising model on a graph and clarify whether the inverse mapping is possible via a modified Krausz construction. From the gauge freedom of frustrated Ising systems, we derive exact, general results about frustration and degeneracy. We demonstrate for the first time that every spin ice graph, with the exception of the one-dimensional Ising model, is degenerate. We then study how degeneracy scales in size, using th

APA, Harvard, Vancouver, ISO, and other styles

7

Ashton, Banda. "Graph Theory in DNA Sequencing: Unveiling Genetic Patterns." International Journal of Biology and Life Sciences 3, no. 1 (2023): 9–13. http://dx.doi.org/10.54097/ijbls.v3i1.9593.

Full text

Abstract:

Graph theory, a branch of mathematics that studies the properties and relationships of graphs, has emerged as a powerful tool in addressing the complexities of DNA sequencing. This paper highlights the application of graph theory in DNA sequencing and its implications in various aspects of genomics research. One fundamental concept in graph theory applied to DNA sequencing is the construction of the de Bruijn graph. This graph represents overlapping k-mers, subsequences of length k, as nodes, with edges connecting adjacent k-mers. By constructing and analyzing the de Bruijn graph, researchers

APA, Harvard, Vancouver, ISO, and other styles

8

Jafari, Hossein, Amir-Reza Feizi-Derakhshi, and Setareh Salehfard. "Proposing a Pure Binary Linear Programming(PBLP) Model to Discover Eulerian Circuits in Complete Graphs." International Journal of Innovation in Management, Economics and Social Sciences 3, no. 2 (2023): 52–61. http://dx.doi.org/10.59615/ijimes.3.2.52.

Full text

Abstract:

Known as a branch of Discrete Mathematics (DM), Graph Theory (GT) describes and solves problems of discrete nature through nodes (i.e., vertices) and arcs (i.e., edges). In this regard, a prominent problem is to find the Eulerian circuits. This paper indicates that the problem can be analyzed through operations research methods. In more general terms, finding the Eulerian circuits could be considered a pathfinding problem. Hence, this paper proposes a pure binary mathematical model to describe the relationship between the variables employed to find the Eulerian circuits. All the analyses in th

APA, Harvard, Vancouver, ISO, and other styles

9

Wafdan, Reza, Mahyus Ihsan, Marwan Ramli, and Hafnani Hafnani. "SOLUSI PERMASALAHAN KOMPUTASI SKALA BESAR PADA SOFTWARE ADOBE FLASH DALAM PERANCANGAN MEDIA PEMBELAJARAN PENCARIAN EULERIAN CIRCUIT." Jurnal Natural 16, no. 1 (2016): 27–32. http://dx.doi.org/10.24815/jn.v16i1.4641.

Full text

Abstract:

Adobe Flash is a software that is used to build an interactive contents that can be attached in other things, such as presentations, games and e-learning. The Eulerian Circuit Search Instructional Media is one of examples in using Adobe Flash in building an interactive instructional media to solve graph theory problems. Visually, Adobe Flash is better than other programming software in general and it is the most suitable one for graph theory, as it uses graphics and visuals to solve problems. The weakness of Adobe Flash is when doing large scale calculations; such as when testing algorithms to

APA, Harvard, Vancouver, ISO, and other styles

10

Fleischner, H. "(Some of) the many uses of Eulerian graphs in graph theory (plus some applications)." Discrete Mathematics 230, no. 1-3 (2001): 23–43. http://dx.doi.org/10.1016/s0012-365x(00)00067-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Eulerian graph theory"

1

Zhan, Mingquan. "Eulerian subgraphs and Hamiltonicity of claw-free graphs." Morgantown, W. Va. : [West Virginia University Libraries], 2003. http://etd.wvu.edu/templates/showETD.cfm?recnum=3024.

Full text

Abstract:

Thesis (Ph. D.)--West Virginia University, 2003.<br>Title from document title page. Document formatted into pages; contains vi, 52 p. : ill. Includes abstract. Includes bibliographical references (p. 50-52).

APA, Harvard, Vancouver, ISO, and other styles

2

Freeman, Andre. "Dual-Eulerian graphs with applications to VLSI design." Link to electronic thesis, 2003. http://www.wpi.edu/Pubs/ETD/Available/etd-0430103-155731/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Vulcani, Renata de Lacerda Martins 1973. "Grafos eulerianos e aplicações." [s.n.], 2015. http://repositorio.unicamp.br/jspui/handle/REPOSIP/306826.

Full text

Abstract:

Orientadores: Celia Picinin de Mello, Anamaria Gomide<br>Dissertação (mestrado profissional) - Universidade Estadual de Campinas, Instituto de Matemática Estatística e Computação Científica<br>Made available in DSpace on 2018-08-26T19:50:54Z (GMT). No. of bitstreams: 1 Vulcani_RenatadeLacerdaMartins_M.pdf: 2431212 bytes, checksum: 702947f1e783d410ef77eb0234852d6a (MD5) Previous issue date: 2015<br>Resumo: Neste trabalho apresentamos uma breve introdução à teoria dos grafos, elucidando alguns conceitos básicos e destacando grafos eulerianos. Usamos o conceito de grafos eulerianos para resolve

APA, Harvard, Vancouver, ISO, and other styles

4

Wang, Yinhua. "Fleet assignment, eulerian subtours and extended steiner trees." Diss., Georgia Institute of Technology, 1995. http://hdl.handle.net/1853/24922.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Fonte, Carla Cristina 1990. "Introdução aos grafos no ensino médio." [s.n.], 2014. http://repositorio.unicamp.br/jspui/handle/REPOSIP/306327.

Full text

Abstract:

Orientador: Pedro José Catuogno<br>Dissertação (mestrado profissional) - Universidade Estadual de Campinas, Instituto de Matemática, Estatística e Computação Científica<br>Made available in DSpace on 2018-08-26T10:58:39Z (GMT). No. of bitstreams: 1 Fonte_CarlaCristina_M.pdf: 29679078 bytes, checksum: 0009a52938b1cb16c79bdc47af10d323 (MD5) Previous issue date: 2014<br>Resumo: Neste trabalho, exploram-se os conceitos iniciais e aplicações importantes da teoria de grafos. Acentuam-se, nas aplicações, alguns problemas clássicos, como o das sete pontes de Königsberg, o do caixeiro viajante e o pr

APA, Harvard, Vancouver, ISO, and other styles

6

Wang, Xiaoji. "Asymptotic enumeration of bipartite graphs, tournaments, digraphs and eulerian digraphs with multiple edges." Phd thesis, 1991. http://hdl.handle.net/1885/139354.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Eulerian graph theory"

1

Fleischner, Herbert. Eulerian graphs and related topics. North-Holland, 1990.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

A, Appleby R., Chen H. C, and Langley Research Center, eds. A general multiblock Euler code for propulsion integration. National Aeronautics and Space Administration, Langley Research Center, 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Kor͡iavov, D. P. O varia͡tsionno-raznostnykh skhemakh geofizicheskoĭ gidrodinamiki v koordinatakh Ėĭlera. V͡TS AN SSSR, 1987.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

P, Chen E., Luk V. K, American Society of Mechanical Engineers. Applied Mechanics Division., and American Society of Mechanical Engineers. Winter Meeting, eds. Advances in numerical simulation techniques for penetration and perforation of solids: Presented at the 1993 ASME Winter Annual Meeting New Orleans, Louisiana November 28-December 3, 1993. American Society of Mechanical Engineers, 1993.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Tom, Walters, California. Dept. of Education., and California. Dept. of Transportation., eds. Choosing a delivery route. Dept. of Education, 1997.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Cai, Zongxi. Deng zhou wen ti. Ke xue chu ban she, 2002.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Fleischner, Herbert. Eulerian Graphs and Related Topics : Eulerian Graphs and Related Topics. North-Holland, 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

A general multiblock Euler code for propulsion integration. National Aeronautics and Space Administration, Langley Research Center, 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

A general multiblock Euler code for propulsion integration. National Aeronautics and Space Administration, Langley Research Center, 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Developing and utilizing an Euler computational method for predicting the airframe/propulsion effects for an aft-mounted turboprop transport. National Aeronautics and Space Administration, Langley Research Center, 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Eulerian graph theory"

1

Henning, Michael A., and Jan H. van Vuuren. "Eulerian graphs." In Graph and Network Theory. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-03857-0_10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Balakrishnan, R., and K. Ranganathan. "Eulerian and Hamiltonian Graphs." In A Textbook of Graph Theory. Springer New York, 2000. http://dx.doi.org/10.1007/978-1-4419-8505-7_6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Balakrishnan, R., and K. Ranganathan. "Eulerian and Hamiltonian Graphs." In A Textbook of Graph Theory. Springer New York, 2012. http://dx.doi.org/10.1007/978-1-4614-4529-6_6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Kurasov, Pavel. "Spectral Gap and Dirichlet Ground State." In Operator Theory: Advances and Applications. Springer Berlin Heidelberg, 2023. http://dx.doi.org/10.1007/978-3-662-67872-5_12.

Full text

Abstract:

AbstractThis chapter is entirely devoted to the studies of the lowest non-trivial eigenvalue of operators on graphs. For standard Laplacians on connected graphs the lowest eigenvalue is $$ \lambda _1 = 0 $$ λ 1 = 0 and we shall be interested in $$ \lambda _2$$ λ 2 , which coincides with the spectral gap $$ \lambda _2 - \lambda _1$$ λ 2 − λ 1 . For Laplacians with Dirichlet vertices it is already non-trivial to calculate the ground state $$ \lambda _1 > 0 $$ λ 1 > 0 . To study these quantities similar methods can be used: Eulerian path and symmetrisation techniques, Cheeger’s approach, surgery principles. Most of these methods work for Schrödinger operators but in order to illuminate connections between spectrum and topology/geometry we shall focus on standard and Dirichlet Laplacians. The methods developed will be extended to higher eigenvalues in the following chapter.

APA, Harvard, Vancouver, ISO, and other styles

5

Iranpoor, Mehdi. "Recovering Drawing Trajectory." In Graph Theory for Operations Research and Management. IGI Global, 2013. http://dx.doi.org/10.4018/978-1-4666-2661-4.ch017.

Full text

Abstract:

Graph theory has many applications in solving real-life problems. However, the application of Eulerian graphs and Eulerian tours/trails seems to be comparatively limited. In this chapter, an application of graph theory in handwriting recognition is presented. There are a lot of studies regarding handwriting recognition. Most of these methods deal with either offline or online handwriting recognition. However, the discussed approaches in this chapter are distinct in the manner that they aim to extract the trajectory of writing so as to equip the offline handwritten image with temporal information. When the trajectory of writing is known, it can be possible to utilize online recognition methods which are more reliable. These trajectory extracting methods are based on Eulerian trails in semi-Eulerian graphs. Semi-Eulerian graphs are graphs with at most two odd vertices. Eulerian trail is a trail in which every edge is traversed exactly once. The methods can be helpful in recognition of single-stroke handwritten images. Relying on the minimum energy law, the methods try to find the smoothest trajectory of writing which contribute to the recognition process.

APA, Harvard, Vancouver, ISO, and other styles

6

Chartrand, Gary, and Ping Zhang. "Eulerian and Hamiltonian Graphs." In Chromatic Graph Theory. Chapman and Hall/CRC, 2019. http://dx.doi.org/10.1201/9780429438868-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

"Eulerian and Hamiltonian Graphs." In Chromatic Graph Theory. Chapman and Hall/CRC, 2008. http://dx.doi.org/10.1201/9781584888017-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

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

9

"Eulerian Multigraphs and The Chinese Postman Problem." In Graph Theory. WORLD SCIENTIFIC, 2015. http://dx.doi.org/10.1142/9789814641609_0004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

"Bipartite, Acyclic, and Eulerian Graphs." In Applied Graph Theory. WORLD SCIENTIFIC, 2023. http://dx.doi.org/10.1142/9789811273117_0004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Eulerian graph theory"

1

Gasparetto, A., R. Vidoni, E. Saccavini, and D. Pillan. "Optimal Path Planning for Painting Robots." In ASME 2010 10th Biennial Conference on Engineering Systems Design and Analysis. ASMEDC, 2010. http://dx.doi.org/10.1115/esda2010-24259.

Full text

Abstract:

In this work, a robotic painting task is addressed in order to automate and improve the efficiency of the process. Usually, path planning in robotic painting is done through self learning programming. Recently, different automated and semi-automated systems have been developed in order to avoid this procedure by using a CAD-drawing to create a CAD-guided trajectory for the paint gun, or by acquiring and recognizing the overall shape of the object to be painted within a library of prestored shapes with associated pre-defined paths. However, a general solution is still lacking, which enables one

APA, Harvard, Vancouver, ISO, and other styles

2

Papoutsakis, Andreas, Sergei Sazhin, Steven Begg, Ionut Danaila, and Francky Luddens. "A new approach to modelling the two way coupling for momentum transfer in a hollow-cone spray." In ILASS2017 - 28th European Conference on Liquid Atomization and Spray Systems. Universitat Politècnica València, 2017. http://dx.doi.org/10.4995/ilass2017.2017.4671.

Full text

Abstract:

A new approach to modelling the interaction between droplets and the carrier phase is suggested. The new model isapplied to the analysis of a spray injected into a chamber of quiescent air, using an Eulerian-Lagrangian approach. The conservative formulation of the equations for mass, momentum and energy transport is used for the analysis of the carrier phase. The dispersed phase is modelled using the Lagrangian approach with droplets represented by individual parcels.The implementation of the Discontinuous Galerkin method (ForestDG), based on a topological representation of the computational m

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!