Relevant bibliographies by topics / Hamiltonian graphs

Contents

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

Academic literature on the topic 'Hamiltonian graphs'

Author: Grafiati
Published: 7 September 2021
Last updated: 25 July 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 'Hamiltonian graphs.'

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 "Hamiltonian graphs"

1

Nagarathnamma, K. G., Leena N. Shenoy, and Sowmya Krishna. "Modified Detour Index of Hamiltonian Connected (Laceable) Graphs." Indian Journal Of Science And Technology 17, no. 19 (2024): 1923–34. http://dx.doi.org/10.17485/ijst/v17i19.1033.

Full text
Abstract:
Objectives: To explore the bounds for the modified detour index of certain Hamiltonian connected and laceable graphs. Methods: The Wiener index , detour index and the modified detour index are used. Findings: Here we introduce the modified detour index and its least upper bounds for Hamiltonian connected and laceable graphs, by formulating the constraints. Novelty: Based on the modified detour index, the bounds for some special graphs such as: Hamiltonian connected graphs of two families of convex polytopes ( and ) and Hamiltonian laceable graphs of spider graph ( ) and image graph of prism gr
APA, Harvard, Vancouver, ISO, and other styles
2

K, G. Nagarathnamma, N. Shenoy Leena, and Krishna Sowmya. "Modified Detour Index of Hamiltonian Connected (Laceable) Graphs." Indian Journal of Science and Technology 17, no. 19 (2024): 1923–34. https://doi.org/10.17485/IJST/v17i19.1033.

Full text
Abstract:
Abstract <strong>Objectives:</strong>&nbsp;To explore the bounds for the modified detour index of certain Hamiltonian connected and laceable graphs.&nbsp;<strong>Methods:</strong>&nbsp;The Wiener index , detour index and the modified detour index are used.&nbsp;<strong>Findings:</strong>&nbsp;Here we introduce the modified detour index and its least upper bounds for Hamiltonian connected and laceable graphs, by formulating the constraints.&nbsp;<strong>Novelty:</strong>&nbsp;Based on the modified detour index, the bounds for some special graphs such as: Hamiltonian connected graphs of two fami
APA, Harvard, Vancouver, ISO, and other styles
3

Thirusangu, K., and K. Rangarajan. "Marked graphs and hamiltonian graphs." Microelectronics Reliability 37, no. 8 (1997): 1243–50. http://dx.doi.org/10.1016/s0026-2714(97)00001-2.

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

Katona, D., A. Kostochka, Ya Pykh, and B. Stechkin. "Locally Hamiltonian graphs." Mathematical Notes of the Academy of Sciences of the USSR 45, no. 1 (1989): 25–29. http://dx.doi.org/10.1007/bf01158712.

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

Chen, Ya-Chen, and Z. Füredi. "Hamiltonian Kneser Graphs." Combinatorica 22, no. 1 (2002): 147–49. http://dx.doi.org/10.1007/s004930200007.

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

Kewen, Zhao, Hong-Jian Lai, and Ju Zhou. "Hamiltonian-connected graphs." Computers & Mathematics with Applications 55, no. 12 (2008): 2707–14. http://dx.doi.org/10.1016/j.camwa.2007.10.018.

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

Wu, Baoyindureng, and Jixiang Meng. "Hamiltonian jump graphs." Discrete Mathematics 289, no. 1-3 (2004): 95–106. http://dx.doi.org/10.1016/j.disc.2004.09.003.

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

Ebrahimi, Mahdi, Ali Iranmanesh, and Mohammad Ali Hosseinzadeh. "Hamiltonian character graphs." Journal of Algebra 428 (April 2015): 54–66. http://dx.doi.org/10.1016/j.jalgebra.2014.12.038.

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

Harary, Frank, and Uri Peled. "Hamiltonian threshold graphs." Discrete Applied Mathematics 16, no. 1 (1987): 11–15. http://dx.doi.org/10.1016/0166-218x(87)90050-3.

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

Manoussakis, Yannis. "Directed hamiltonian graphs." Journal of Graph Theory 16, no. 1 (1992): 51–59. http://dx.doi.org/10.1002/jgt.3190160106.

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

Dissertations / Theses on the topic "Hamiltonian graphs"

1

Iturriaga-Velazquez, Claudia C. "Intersection graphs, fraternally orientable graphs and hamiltonian cycles." Thesis, University of Ottawa (Canada), 1994. http://hdl.handle.net/10393/6808.

Full text
Abstract:
Consider a graph G(V, E), where V and E denote the vertex and edge sets of G(V, E), respectively. An orientation $\vec G$ of G(V, E) is the result of giving an orientation to the edges of G. A directed graph is fraternally oriented if for every three vertices u, v, w, the existence of the edges $u\to w$ and $v\to w$ implies that $u\to v$ or $v\to u$. A graph G is fraternally orientable if there exists an orientation $\vec G$ that is fraternally oriented. In this thesis we study some properties of fraternally orientable graphs, and we describe an algorithm to find a hamiltonian cycle in strongl
APA, Harvard, Vancouver, ISO, and other styles
2

Streib, Noah Sametz. "Planar and hamiltonian cover graphs." Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/43744.

Full text
Abstract:
This dissertation has two principal components: the dimension of posets with planar cover graphs, and the cartesian product of posets whose cover graphs have hamiltonian cycles that parse into symmetric chains. Posets of height two can have arbitrarily large dimension. In 1981, Kelly provided an infinite sequence of planar posets that shows that the dimension of planar posets can also be arbitrarily large. However, the height of the posets in this sequence increases with the dimension. In 2009, Felsner, Li, and Trotter conjectured that for each integer h at least 2, there exists a least po
APA, Harvard, Vancouver, ISO, and other styles
3

Ghenciu, Petre Ion. "Hamiltonian cycles in subset and subspace graphs." Thesis, University of North Texas, 2004. https://digital.library.unt.edu/ark:/67531/metadc4662/.

Full text
Abstract:
In this dissertation we study the Hamiltonicity and the uniform-Hamiltonicity of subset graphs, subspace graphs, and their associated bipartite graphs. In 1995 paper "The Subset-Subspace Analogy," Kung states the subspace version of a conjecture. The study of this problem led to a more general class of graphs. Inspired by Clark and Ismail's work in the 1996 paper "Binomial and Q-Binomial Coefficient Inequalities Related to the Hamiltonicity of the Kneser Graphs and their Q-Analogues," we defined subset graphs, subspace graphs, and their associated bipartite graphs. The main emphasis of this d
APA, Harvard, Vancouver, ISO, and other styles
4

High, David. "On 4-Regular Planar Hamiltonian Graphs." TopSCHOLAR®, 2006. http://digitalcommons.wku.edu/theses/277.

Full text
Abstract:
In order to research knots with large crossing numbers, one would like to be able to select a random knot from the set of all knots with n crossings with as close to uniform probability as possible. The underlying graph of a knot diagram can be viewed as a 4-regular planar graph. The existence of a Hamiltonian cycle in such a graph is necessary in order to use the graph to compute an upper bound on rope length for a given knot. The algorithm to generate such graphs is discussed and an exact count of the number of graphs is obtained. In order to allow for the existence of such a count, a some
APA, Harvard, Vancouver, ISO, and other styles
5

Li, Mingchu. "Hamiltonian properties of claw-free graphs." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape15/PQDD_0001/NQ35223.pdf.

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

Alabdullatif, Mosaad. "Extremal graphs with Hamiltonian related properties." Thesis, Keele University, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.362161.

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

Yang, Weihua. "Supereulerian graphs, Hamiltonicity of graphes and several extremal problems in graphs." Phd thesis, Université Paris Sud - Paris XI, 2013. http://tel.archives-ouvertes.fr/tel-00877793.

Full text
Abstract:
In this thesis, we focus on the following topics: supereulerian graphs, hamiltonian line graphs, fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees, and several extremal problems on the (minimum and/or maximum) size of graphs under a given graph property. The thesis includes six chapters. The first one is to introduce definitions and summary the main results of the thesis, and in the last chapter we introduce the furture research of the thesis. The main studies in Chapters 2 - 5 are as follows. In Chapter 2, we explore conditions for a graph to be supereul
APA, Harvard, Vancouver, ISO, and other styles
8

Vandegriend, Basil. "Finding Hamiltonian cycles, algorithms, graphs and performance." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp04/mq28995.pdf.

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

Madden, Yale. "Loop Edge Estimation in 4-Regular Hamiltonian Graphs." TopSCHOLAR®, 2007. http://digitalcommons.wku.edu/theses/406.

Full text
Abstract:
In knot theory, a knot is defined as a closed, non-self-intersecting curve embedded in three-dimensional space that cannot be untangled to produce a simple planar loop. A mathematical knot is essentially a conventional knot tied with rope where the ends of the rope have been glued together. One way to sample large knots is based on choosing a 4-regular Hamiltonian planar graph. A method for generating rooted 4-regular Hamiltonian planar graphs with n vertices is discussed in this thesis. In the generation process of these graphs, some vertices are introduced that can be easily eliminated from
APA, Harvard, Vancouver, ISO, and other styles
10

Ascigil, Mehmet. "An Algorithm to Generate 4-Regular Planar Hamiltonian Graphs." TopSCHOLAR®, 2006. http://digitalcommons.wku.edu/theses/440.

Full text
Abstract:
In this paper, the problem of randomly generating 4-regular planar Hamiltonian graphs is discussed and a solution is described. An algorithm which efficiently generates the graphs in linear time and in a near-uniform manner is given. In addition, a formula is provided that determines the total number of such graphs. The generation of graphs starts with forming the Hamiltonian cycle of the final graph. Each vertex is randomly assigned to be connected with zero. one. Or two edges in the area bounded by the Hamiltonian cycle. A positive prefix vector is used to determine all the edges in the area
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Hamiltonian graphs"

1

Reay, John R. Hamiltonian cycles in t-graphs. Springer-Verlag, 2000.

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

Li, Mingchu. Hamiltonian properties of claw-free graphs. [s.n.], 1998.

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

Dyer, Martin. Approximately counting Hamilton cycles in dense graphs. LFCS, Dept. of Computer Science, University of Edinburgh, 1993.

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

Schaar, Günter. Hamiltonian properties of products of graphs and digraphs. Teubner, 1988.

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

Filar, Jerzy A. Controlled markov chains, graphs and hamiltonicity. Now Publishers, 2007.

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

Freĭdlin, M. I. Random perturbations of Hamiltonian systems. American Mathematical Society, 1994.

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

Kyaw, Shwe. A Dirac-type criterion for hamiltonicity. Verlag Köster, 1994.

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

Reggini, Horacio C. Regular polyhedra: Random generation, Hamiltonian paths, and single chain nets. Academia Nacional de Ciencias Exactas, Físicas y Naturales, 1991.

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

Ning, Xuanxi. The blocking flow theory and its application to Hamiltonian graph problems. Shaker Verlag, 2006.

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

Hertel, Alexander. Hamiltonian cycles in sparse graphs. 2004.

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

Book chapters on the topic "Hamiltonian graphs"

1

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

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

Babel, Luitpold, and Gerhard J. Woeginger. "Pseudo-hamiltonian graphs." In Graph-Theoretic Concepts in Computer Science. Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/bfb0024486.

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

Golumbic, Martin Charles, and André Sainte-Laguë. "VII Hamiltonian graphs." In The Zeroth Book of Graph Theory. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-61420-1_8.

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

Ray, Saha. "Euler Graphs and Hamiltonian Graphs." In Graph Theory with Algorithms and its Applications. Springer India, 2012. http://dx.doi.org/10.1007/978-81-322-0750-4_3.

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

Aldous, Joan M., and Robin J. Wilson. "Eulerian and Hamiltonian Graphs." In Graphs and Applications. Springer London, 2000. http://dx.doi.org/10.1007/978-1-4471-0467-4_3.

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

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
7

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
8

Li, Deng-Xin, Hong-Jian Lai, Ye-Hong Shao, and Mingquan Zhan. "Hamiltonian Connected Line Graphs." In Computational Science – ICCS 2007. Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-72588-6_61.

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

Rama, R. "Eulerian and Hamiltonian Graphs." In Topics in Combinatorics and Graph Theory. Springer Nature Switzerland, 2025. https://doi.org/10.1007/978-3-031-74252-1_17.

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

Borkar, Vivek S., Vladimir Ejov, Jerzy A. Filar, and Giang T. Nguyen. "Illustrative Graphs." In Hamiltonian Cycle Problem and Markov Chains. Springer New York, 2012. http://dx.doi.org/10.1007/978-1-4614-3232-6_1.

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

Conference papers on the topic "Hamiltonian graphs"

1

Gao, Qinghe, Daniel C. Miedema, Yidong Zhao, Jana M. Weber, Qian Tao, and Artur M. Schweidtmann. "Bayesian uncertainty quantification of graph neural networks using stochastic gradient Hamiltonian Monte Carlo." In The 35th European Symposium on Computer Aided Process Engineering. PSE Press, 2025. https://doi.org/10.69997/sct.111298.

Full text
Abstract:
Graph neural networks (GNNs) have proven state-of-the-art performance in molecular property prediction tasks. However, a significant challenge with GNNs is the reliability of their predictions, particularly in critical domains where quantifying model confidence is essential. Therefore, assessing uncertainty in GNN predictions is crucial to improving their robustness. Existing uncertainty quantification methods, such as Deep ensembles and Monte Carlo Dropout, have been applied to GNNs with some success, but these methods are limited to approximate the full posterior distribution. In this work,
APA, Harvard, Vancouver, ISO, and other styles
2

Langfitt, Quinn, Reuben Tate, and Stephan Eidenbenz. "Phantom Edges in the Problem Hamiltonian: A Method for Increasing Performance and Graph Visibility for QAOA." In 2025 International Conference on Quantum Communications, Networking, and Computing (QCNC). IEEE, 2025. https://doi.org/10.1109/qcnc64685.2025.00016.

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

Veillon, Matias, Christian A. Rojas, Hector Ramirez, and Eduardo Espinosa. "On the Modeling of a Three-Level Flying Capacitor Buck DC-DC Converter based on Bond Graph and Port Hamiltonian System Approaches." In 2024 IEEE International Conference on Automation/XXVI Congress of the Chilean Association of Automatic Control (ICA-ACCA). IEEE, 2024. http://dx.doi.org/10.1109/ica-acca62622.2024.10766802.

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

Merino, Arturo, Torsten Mütze, and Namrata. "Kneser Graphs Are Hamiltonian." In STOC '23: 55th Annual ACM Symposium on Theory of Computing. ACM, 2023. http://dx.doi.org/10.1145/3564246.3585137.

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

Chen, Y.-Chuang, Yong-Zen Huang, Lih-Hsing Hsu, Jimmy J. M. Tan, Theodore E. Simos, and George Psihoyios. "Optimal Fault-Tolerant Hamiltonian and Hamiltonian Connected Graphs." In INTERNATIONAL ELECTRONIC CONFERENCE ON COMPUTER SCIENCE. AIP, 2008. http://dx.doi.org/10.1063/1.3037089.

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

Mütze, Torsten, Jerri Nummenpalo, and Bartosz Walczak. "Sparse Kneser graphs are Hamiltonian." In STOC '18: Symposium on Theory of Computing. ACM, 2018. http://dx.doi.org/10.1145/3188745.3188834.

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

Harel, David. "Hamiltonian paths in infinite graphs." In the twenty-third annual ACM symposium. ACM Press, 1991. http://dx.doi.org/10.1145/103418.103445.

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

Aziz, Noor A’lawiah Abd, Nader Jafari Rad, Hailiza Kamarulhaili, and Roslan Hasni. "Some properties of k-step Hamiltonian graphs." In PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON MATHEMATICAL SCIENCES AND TECHNOLOGY 2018 (MATHTECH2018): Innovative Technologies for Mathematics & Mathematics for Technological Innovation. AIP Publishing, 2019. http://dx.doi.org/10.1063/1.5136366.

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

Femila, L. T. Cherin Monish, and S. Asha. "Hamiltonian fuzzy anti-magic labeling of graphs." In INTERNATIONAL CONFERENCE ON ADVANCES IN MATERIALS, COMPUTING AND COMMUNICATION TECHNOLOGIES: (ICAMCCT 2021). AIP Publishing, 2022. http://dx.doi.org/10.1063/5.0072170.

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

Hung, Ruo-Wei, Jun-Lin Li, and Chih-Han Lin. "The Hamiltonian connectivity of some alphabet supergrid graphs." In 2017 IEEE 8th International Conference on Awareness Science and Technology (iCAST). IEEE, 2017. http://dx.doi.org/10.1109/icawst.2017.8256461.

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

Reports on the topic "Hamiltonian graphs"

1

Markus, Lisa R. Hamiltonian Results in K(l,r)-Free Graphs. Defense Technical Information Center, 1993. http://dx.doi.org/10.21236/ada266352.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Hamiltonian graphs' for particular source types:
Journal articles Dissertations / Theses
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