Log in

Relevant bibliographies by topics / Hamiltonian graphs / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Hamiltonian graphs.

Dissertations / Theses 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 top 50 dissertations / theses for your research 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.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

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

11

Mofokeng, Tshenolo. "Hamiltonian cycles in maximal planar graphs and planar triangulations." Master's thesis, University of Cape Town, 2017. http://hdl.handle.net/11427/25389.

Full text

Abstract:

In this thesis we study planar graphs, in particular, maximal planar graphs and general planar triangulations. In Chapter 1 we present the terminology and notations that will be used throughout the thesis and review some elementary results on graphs that we shall need. In Chapter 2 we study the fundamentals of planarity, since it is the cornerstone of this thesis. We begin with the famous Euler's Formula which will be used in many of our results. Then we discuss another famous theorem in graph theory, the Four Colour Theorem. Lastly, we discuss Kuratowski's Theorem, which gives a characterizat

APA, Harvard, Vancouver, ISO, and other styles

12

Dey, Sanjoy. "Structural properties of visibility and weak visibility graphs." Virtual Press, 1997. http://liblink.bsu.edu/uhtbin/catkey/1048394.

Full text

Abstract:

Given a finite set S of n nonintersecting line segments with no three end points collinear, the segment end point visibility graph is defined as the graph whose vertices are the end points of the line segments in S and two vertices are adjacent if the straight line segment joining two end points does not intersect any element of S, or if they are end points of the same segment. Segment end point visibility graphs have a wide variety of applications in VLSI circuit design, study of art gallery problems, and other areas of computational geometry. This thesis contains a survey of the important re

APA, Harvard, Vancouver, ISO, and other styles

13

Muche, Tilahun Abay. "Hamiltonian Sets of Polygonal Paths in 4-Valent Spatial Graphs." Scholar Commons, 2012. http://scholarcommons.usf.edu/etd/4177.

Full text

Abstract:

Spatial graphs with 4–valent rigid vertices and two single valent endpoints, called assembly graphs, model DNA recombination processes that appear in certain species of ciliates. Recombined genes are modeled by certain types of paths in an assembly graph that make a ”oper pendicular ” turn at each 4–valent vertex of the graph called polygonal paths. The assembly number of an assembly graph is the minimum number of polygonal paths that visit each vertex exactly once. In particular, an assembly graph is called realizable if the graph has a Hamiltonian polygonal path. An assembly graph ɣ^ obtaine

APA, Harvard, Vancouver, ISO, and other styles

14

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

15

Ozkan, Sibel. "Hamilton decompositions of graphs with primitive complements." Auburn, Ala., 2007. http://repo.lib.auburn.edu/2007%20Spring%20Dissertations/OZKAN_SIBEL_27.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Rudoy, Mikhail. "Hamiltonian cycle and related problems : vertex-breaking, grid graphs, and Rubik's Cubes." Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/113112.

Full text

Abstract:

Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2017.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Cataloged from student-submitted PDF version of thesis.<br>Includes bibliographical references (pages 123-124).<br>In this thesis, we analyze the computational complexity of several problems related to the Hamiltonian Cycle problem. We begin by introducing a new problem, which we call Tree-Residue Vertex-Breaking (TRVB). Giv

APA, Harvard, Vancouver, ISO, and other styles

17

Teska, Jakub University of Ballarat. "Graphs and subgraphs with bounded degree." Author, 2008. http://archimedes.ballarat.edu.au:8080/vital/access/HandleResolver/1959.17/12806.

Full text

Abstract:

"The topology of a network (such as a telecommunications, multiprocessor, or local area network, to name just a few) is usually modelled by a graph in which vertices represent 'nodes' (stations or processors) while undirected or directed edges stand for 'links' or other types of connections, physical or virtual. A cycle that contains every vertex of a graph is called a hamiltonian cycle and a graph which contains a hamiltonian cycle is called a hamiltonian graph. The problem of the existence of a hamiltonian cycle is closely related to the well known problem of a travelling salesman. These pro

APA, Harvard, Vancouver, ISO, and other styles

18

Teska, Jakub. "Graphs and subgraphs with bounded degree." Thesis, Ballarat, Vic. : Author, 2008. http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/38757.

Full text

Abstract:

"The topology of a network (such as a telecommunications, multiprocessor, or local area network, to name just a few) is usually modelled by a graph in which vertices represent 'nodes' (stations or processors) while undirected or directed edges stand for 'links' or other types of connections, physical or virtual. A cycle that contains every vertex of a graph is called a hamiltonian cycle and a graph which contains a hamiltonian cycle is called a hamiltonian graph. The problem of the existence of a hamiltonian cycle is closely related to the well known problem of a travelling salesman. These pro

APA, Harvard, Vancouver, ISO, and other styles

19

Teska, Jakub. "Graphs and subgraphs with bounded degree." Author, 2008. http://archimedes.ballarat.edu.au:8080/vital/access/HandleResolver/1959.17/15398.

Full text

Abstract:

"The topology of a network (such as a telecommunications, multiprocessor, or local area network, to name just a few) is usually modelled by a graph in which vertices represent 'nodes' (stations or processors) while undirected or directed edges stand for 'links' or other types of connections, physical or virtual. A cycle that contains every vertex of a graph is called a hamiltonian cycle and a graph which contains a hamiltonian cycle is called a hamiltonian graph. The problem of the existence of a hamiltonian cycle is closely related to the well known problem of a travelling salesman. These pro

APA, Harvard, Vancouver, ISO, and other styles

20

Wagner, Andrew. "On the Existence of a Second Hamilton Cycle in Hamiltonian Graphs With Symmetry." Thèse, Université d'Ottawa / University of Ottawa, 2013. http://hdl.handle.net/10393/30290.

Full text

Abstract:

In 1975, Sheehan conjectured that every simple 4-regular hamiltonian graph has a second Hamilton cycle. If Sheehan's Conjecture holds, then the result can be extended to all simple d-regular hamiltonian graphs with d at least 3. First, we survey some previous results which verify the existence of a second Hamilton cycle if d is large enough. We will then demonstrate some techniques for finding a second Hamilton cycle that will be used throughout this paper. Finally, we use these techniques and show that for certain 4-regular Hamiltonian graphs whose automorphism group is large enough, a se

APA, Harvard, Vancouver, ISO, and other styles

21

He, Weihua. "Cycles in graphs and arc colorings in digraphs." Thesis, Paris 11, 2014. http://www.theses.fr/2014PA112352.

Full text

Abstract:

Dans cette thèse nous étudions quatre problèmes de théorie des graphes. En particulier,Nous étudions le problème du cycle hamiltonien dans les line graphes, et aussi nous prouvons l’existence de cycles hamiltoniens dans certains sous graphes couvrants d’un line graphe. Notre résultat principal est: Si L(G) est hamiltonien, alors SL(G) est hamiltonien. Grâce à ce résultat nous proposons une conjecture équivalente à des conjectures célèbres. Et nous obtenons deux résultats sur les cycles hamiltoniens disjoints dans les line graphes.Nous considérons alors la bipancyclicité résistante aux pannes d

APA, Harvard, Vancouver, ISO, and other styles

22

Becker, Kai Helge. "Twin-constrained Hamiltonian paths on threshold graphs : an approach to the minimum score separation problem." Thesis, London School of Economics and Political Science (University of London), 2010. http://etheses.lse.ac.uk/3209/.

Full text

Abstract:

The Minimum Score Separation Problem (MSSP) is a combinatorial problem that has been introduced in JORS 55 as an open problem in the paper industry arising in conjunction with the cutting-stock problem. During the process of producing boxes, áat papers are prepared for folding by being scored with knives. The problem is to determine if and how a given production pattern of boxes can be arranged such that a certain minimum distance between the knives can be kept. While it was originally suggested to analyse the MSSP as a specific variant of a Generalized Travelling Salesman Problem, the thesis

APA, Harvard, Vancouver, ISO, and other styles

23

Bedenknecht, Wiebke [Verfasser], and Christian [Akademischer Betreuer] Reiher. "Local density properties of Andrásfai graphs and powers of Hamiltonian cycles in hypergraphs / Wiebke Bedenknecht ; Betreuer: Christian Reiher." Hamburg : Staats- und Universitätsbibliothek Hamburg, 2018. http://d-nb.info/1166851176/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Bedenknecht, Wiebke Verfasser], and Christian [Akademischer Betreuer] [Reiher. "Local density properties of Andrásfai graphs and powers of Hamiltonian cycles in hypergraphs / Wiebke Bedenknecht ; Betreuer: Christian Reiher." Hamburg : Staats- und Universitätsbibliothek Hamburg, 2018. http://nbn-resolving.de/urn:nbn:de:gbv:18-92958.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Bergougnoux, Benjamin. "Matrix decompositions and algorithmic applications to (hyper)graphs." Thesis, Université Clermont Auvergne‎ (2017-2020), 2019. http://www.theses.fr/2019CLFAC025/document.

Full text

Abstract:

Durant ces dernières décennies, d'importants efforts et beaucoup de café ont été dépensés en vue de caractériser les instances faciles des problèmes NP-difficiles. Dans ce domaine de recherche, une approche s'avère être redoutablement efficace : la théorie de la complexité paramétrée introduite par Downey et Fellows dans les années 90.Dans cette théorie, la complexité d'un problème n'est plus mesurée uniquement en fonction de la taille de l'instance, mais aussi en fonction d'un paramètre .Dans cette boite à outils, la largeur arborescente est sans nul doute un des paramètres de graphe les plus

APA, Harvard, Vancouver, ISO, and other styles

26

Granholm, Jonas. "Some cyclic properties of graphs with local Ore-type conditions." Thesis, Linköpings universitet, Matematik och tillämpad matematik, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-129213.

Full text

Abstract:

A Hamilton cycle in a graph is a cycle that passes through every vertex of the graph. A graph is called Hamiltonian if it contains such a cycle. In this thesis we investigate two classes of graphs, defined by local criteria. Graphs in these classes, with a simple set of exceptions K, were proven to be Hamiltonian by Asratian, Broersma, van den Heuvel, and Veldman in 1996 and by Asratian in 2006, respectively. We prove here that in addition to being Hamiltonian, graphs in these classes have stronger cyclic properties. In particular, we prove that if a graph G belongs to one of these classes, th

APA, Harvard, Vancouver, ISO, and other styles

27

Borozan, Valentin. "Proper and weak-proper trees in edges-colored graphs and multigraphs." Phd thesis, Université Paris Sud - Paris XI, 2011. http://tel.archives-ouvertes.fr/tel-00738959.

Full text

Abstract:

Dans la présente thèse nous étudions l'extraction d'arbres dans des graphes arêtes-coloriés.Nous nous concentrons sur la recherche d'arbres couvrants proprement arête-coloriés et faiblement arête-coloriés, notée PST et WST. Nous montrons que les versions d'optimisation de ces problèmes sont NP-Complete dans le cas général des graphes arêtes-coloriés, et nous proposons des algorithmes pour trouver ces arbres dans le cas des graphes arêtes-coloriés sans cycles proprement arêtes-coloriés.Nous donnons également quelques limites de nonapproximabilité. Nous proposons des conditions suffisantes pour

APA, Harvard, Vancouver, ISO, and other styles

28

Montero, Leandro Pedro. "Graphes et couleurs : graphes arêtes-coloriés, coloration d'arêtes et connexité propre." Phd thesis, Université Paris Sud - Paris XI, 2012. http://tel.archives-ouvertes.fr/tel-00776899.

Full text

Abstract:

Dans cette thèse nous étudions différents problèmes de graphes et multigraphes arêtes-coloriés tels que la connexité propre, la coloration forte d'arêtes et les chaînes et cycles hamiltoniens propres. Enfin, nous améliorons l'algorithme connu $O(n^4)$ pour décider du comportement d'un graphe sous opérateur biclique, en étudiant les bicliques dans les graphes sans faux jumeaux. Plus précisément, 1) Nous étudions d'abord le nombre $k$-connexité-propre des graphes, noté $pc_k(G)$, ç'est à dire le nombre minimum de couleurs nécessaires pour colorer les arêtes d'un graphe de façon à ce qu'entre cha

APA, Harvard, Vancouver, ISO, and other styles

29

Sun, Qiang. "A contribution to the theory of (signed) graph homomorphism bound and Hamiltonicity." Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLS109/document.

Full text

Abstract:

Dans cette thèse, nous etudions deux principaux problèmes de la théorie des graphes: problème d’homomorphisme des graphes planaires (signés) et problème de cycle hamiltonien.Comme une extension du théorème des quatre couleurs, il est conjecturé([80], [41]) que chaque graphe signé cohérent planaire de déséquilibré-maille d+1(d>1) admet un homomorphisme à cube projective signé SPC(d) de dimension d. La question suivant étalés naturelle:Est-ce que SPC(d) une borne optimale de déséquilibré-maille d+1 pour tous les graphes signés cohérente planaire de déséquilibré-maille d+1?Au Chapitre 2, nous

APA, Harvard, Vancouver, ISO, and other styles

30

Manoussakis, Yannis. "Existence de cycles et chaines dans des graphes orientés ou non en liaison avec des paramètres de ces graphes (connexité, stabilité, degré)." Paris 11, 1985. http://www.theses.fr/1985PA112038.

Full text

Abstract:

Dans cette thèse nous avons étudié, pour des graphes non orientés ou orientés, des conditions impliquant l'existence de : - cycles hamiltoniens, -cycles de longueur supérieure à une borne donnée. - chaînes de longueur bornée inférieurement ou supérieurement (problèmes de diamètre et de graphes hamilton-connectés). -une couverture des sommets par des cycles. Ces conditions concernent l'ordre, la taille, la connexité, la stabilité et les degrés du graphe<br>In this thesis we study conditions which imply for graphs or digraphs the existence of: - Hamiltonian cycles. - Cycles of length greater tha

APA, Harvard, Vancouver, ISO, and other styles

31

Hocini, Fadila. "Combinatoire énumérative de plusieurs structures finies." Paris 6, 1986. http://www.theses.fr/1986PA066210.

Full text

Abstract:

On construit deux bijections entre d'une part l'ensemble des "forêts standards ordinaires" et l'ensemble des "ponts ordinaires" et d'autre part entre l'ensemble des "forêts standards pondérés" et l'ensemble des "ponts faiblement surdiagonaux dont les longueurs des sauts et des paliers sont paires". On construit aussi une bijection entre l'ensemble des "forêts standards pondérés de poids n, ayant deux arbres" et l'ensemble des "forêts standards pondérés de poids n, ayant trois arbres.

APA, Harvard, Vancouver, ISO, and other styles

32

Santos, Marcelo de Souza. "Ciclos hamiltonianos em grafos." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2016. http://hdl.handle.net/10183/150239.

Full text

Abstract:

Neste trabalho tratamos de um problema clássico bem conhecido em Teoria dos Grafos: o problema da existência de um ciclo hamiltoniano. Um grafo é dito hamiltoniano se possui um ciclo hamiltoniano, ou seja, apresenta um ciclo que percorre todos os vértices do grafo. Estudamos problemas clássicos associados a este problema em termos do número de arestas, do grau mínimo e da sequência de graus dos vértices de um grafo. Além disso, estudamos resultados espectrais para o problema de hamiltonicidade referentes às matrizes de adjacências e laplaciana. A principal contribuição deste trabalho é a apres

APA, Harvard, Vancouver, ISO, and other styles

33

Lignos, Ioannis. "Reconfigurations of combinatorial problems : graph colouring and Hamiltonian cycle." Thesis, Durham University, 2017. http://etheses.dur.ac.uk/12098/.

Full text

Abstract:

We explore algorithmic aspects of two known combinatorial problems, Graph Colouring and Hamiltonian Cycle, by examining properties of their solution space. One can model the set of solutions of a combinatorial problem $P$ by the solution graph $R(P)$, where vertices are solutions of $P$ and there is an edge between two vertices, when the two corresponding solutions satisfy an adjacency reconfiguration rule. For example, we can define the reconfiguration rule for graph colouring to be that two solutions are adjacent when they differ in colour in exactly one vertex. The exploration of the proper

APA, Harvard, Vancouver, ISO, and other styles

34

Bajo, Calderon Erica. "An Exploration on the Hamiltonicity of Cayley Digraphs." Youngstown State University / OhioLINK, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=ysu161982054497591.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Fraisse, Pierre. "Longs cycles dans les graphes : applications aux réseaux de Pétri." Paris 11, 1986. http://www.theses.fr/1986PA112037.

Full text

Abstract:

Cette thèse se compose de plusieurs chapitres. Le premier porte sur l’existence de certains longs cycles dans des graphes de grand degré, cycles hamiltoniens et p-dominants en particulier. Il se compose des articles 1 à 5. Le second porte sur les facteurs de graphes, et contient les articles 6 à 7. Le troisième porter sur les couvertures des arêtes et des sommets d’un graphe par une famille de cycles de longueur totale minimale (article 8). Le quatrième donne un premier résultat sur l’index chromatique des graphes aléatoires réguliers. Il permet de conjecturer que presque tout graphe r-régulie

APA, Harvard, Vancouver, ISO, and other styles

36

Chera, Catalin-Marian. "Contribution à l'extension de l'approche énergétique à la représentation des systèmes à paramètres distribués." Phd thesis, Ecole Centrale de Lille, 2009. http://tel.archives-ouvertes.fr/tel-00578842.

Full text

Abstract:

Tout phénomène, qu'il soit biologique, géologique ou mécanique peut être décrit à l'aide de lois de la physique en termes d'équations différentielles, algébriques ou intégrales, mettant en relation différentes variables physiques. Les objectifs de la thèse sont de montrer comment les systèmes à paramètres distribués peuvent être modélisés par un modèle bond graph, qui est par nature un modèle à paramètres localisés. Deux approches sont possibles : - utiliser une technique d'approximation qui discrétise le modèle initialement sous forme d'équations aux dérivées partielles (EDP) dans le domaine

APA, Harvard, Vancouver, ISO, and other styles

37

Gancarzewicz, Grzegorz. "Problèmes extrémaux en théorie des graphes, généralisations du problème hamiltonien." Paris 11, 2004. http://www.theses.fr/2004PA112105.

Full text

Abstract:

La description de la théorie extrémale des graphes donnée par B. Bollobásest la suivante :La théorie extrémale des graphes est une branche de la théorie des graphes qui consiste à trouver des relations entre divers invariants de graphes comme l'ordre, les degrés maximum et minimum, le minimum de la somme des degrés pris pour toute paire de sommets non adjacents. Plus généralement, à trouver les valeurs extrêmes de ces invariants qui assurent qu'un graphe possède une propriété donnée. Dans un graphe G un cycle qui contient tous les sommets de G est un cycle hamiltonien de G, Un graphe est hamil

APA, Harvard, Vancouver, ISO, and other styles

38

Bruno, Nicholas J. "A Sufficient Condition for Hamiltonian Connectedness in Standard 2-Colored Multigraphs." Miami University / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=miami1438385443.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Costa, Polyanna Possani da [UNESP]. "Teoria dos grafos e suas aplicações." Universidade Estadual Paulista (UNESP), 2011. http://hdl.handle.net/11449/94358.

Full text

Abstract:

Made available in DSpace on 2014-06-11T19:27:10Z (GMT). No. of bitstreams: 0 Previous issue date: 2011-12-01Bitstream added on 2014-06-13T19:06:46Z : No. of bitstreams: 1 costa_pp_me_rcla.pdf: 598986 bytes, checksum: 67c1c7e0c368ded41dbfb9631bdf1362 (MD5)<br>Neste trabalho estudamos a Teoria de Grafos e a aplicamos na solução de alguns problemas clássicos, como por exemplo O Problema das Pontes de Königsberg, O Problema do Caixeiro Viajante, Classificação dos Poliedros Regulares e Coloração de Mapas. As ferramentas básicas foram Topologia Geral e Álgebra<br>In this work we study Graph Theory

APA, Harvard, Vancouver, ISO, and other styles

40

Pucohuaranga, Jorge Luis Barbieri. "Ciclos hamiltonianos em produtos cartesianos de grafos." reponame:Repositório Institucional da UFABC, 2015.

Find full text

Abstract:

Orientador: Prof. Dr. Letícia Rodrigues Bueno<br>Dissertação (mestrado) - Universidade Federal do ABC, Programa de Pós-Graduação em Ciência da Computação, 2015.<br>Given a graph G, the hamiltonian cycle problem consists in determining if there is a cycle containing all vertices of G exactly once. This problem is known to be NP-Complete, therefore a recent trend is to searching for long cycles in order to determine the cycle with the largest possible number of vertices. Another trend is searching for related structures. In this aspect, being prism-hamiltonian has been an interesting relaxation

APA, Harvard, Vancouver, ISO, and other styles

41

Al-Mashhadani, Israa Badr. "Integrating bond graph with Port-Hamiltonian formulation for memristor non-linear circuit elements." Thesis, University of Reading, 2017. http://centaur.reading.ac.uk/78141/.

Full text

Abstract:

The discovery of flux controlled memristors (Memory Resistor) by Leon Chua in 1971 as the missing element relating flux to charge, opens up possibilities for the development of a novel class of dielectrics over the coming years. With memristive components there is a departure from linearity; and components exhibit nonlinear characteristics. These properties enable the memristive elements to be used for the successful modeling of a number of physical devices and systems. The Bond Graph is one of graph theory modeling techniques, whose graphical description directly reveals the allocation and ma

APA, Harvard, Vancouver, ISO, and other styles

42

Costa, Polyanna Possani da. "Teoria dos grafos e suas aplicações /." Rio Claro : [s.n.], 2011. http://hdl.handle.net/11449/94358.

Full text

Abstract:

Orientador: Thiago de Melo<br>Banca: Elíris Cristina Rizziolli<br>Banca: Luiz Roberto Hartmann Junior<br>Resumo: Neste trabalho estudamos a Teoria de Grafos e a aplicamos na solução de alguns problemas clássicos, como por exemplo O Problema das Pontes de Königsberg, O Problema do Caixeiro Viajante, Classificação dos Poliedros Regulares e Coloração de Mapas. As ferramentas básicas foram Topologia Geral e Álgebra<br>Abstract: In this work we study Graph Theory and we apply it in the solution of some classical problems, for example Königsberg Bridges Problem, Travelling Salesman Problem, Classifi

APA, Harvard, Vancouver, ISO, and other styles

43

Wang, Bin. "Rainbow structures in properly edge-colored graphs and hypergraph systems." Electronic Thesis or Diss., université Paris-Saclay, 2024. http://www.theses.fr/2024UPASG016.

Full text

Abstract:

La combinatoire extrémale est l'une des branches les plus vigoureuses des mathématiques combinatoires au cours des dernières décennies, et elle a été largement utilisée en informatique, en conception de réseaux et en conception de codage. Elle se concentre sur la détermination de la taille maximale ou minimale possible de certaines structures combinatoires, sous certaines conditions ou contraintes. Les ensembles hôtes peuvent être des graphes, des digraphes, des graphes aléatoires, des hypergraphes, des entiers, des nombres premiers, des ensembles, des graphes avec arêtes colorées, etc. Les st

APA, Harvard, Vancouver, ISO, and other styles

44

Carvalho, Marcelo Dantas de. "Classificação dos digrafos semicompletos hamiltonianos." [s.n.], 2000. http://repositorio.unicamp.br/jspui/handle/REPOSIP/306861.

Full text

Abstract:

Orientador: Claudina Izepe Rodrigues<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matematica, Estatistica e Computação Cientifica<br>Made available in DSpace on 2018-07-26T16:57:25Z (GMT). No. of bitstreams: 1 Carvalho_MarceloDantasde_M.pdf: 1298387 bytes, checksum: 14167c08257e5465066717df5f9963e6 (MD5) Previous issue date: 2000<br>Resumo: 0 objetivo principal deste trabalho é apresentar uma classificação para os dígrafos semicompletos hamiltonianos, extendendo os resultados obtidos para os torneios. Para isso utilizamos da teoria da homotopia regular de grafo

APA, Harvard, Vancouver, ISO, and other styles

45

Amar, Denise. "Théorie des graphes, étude de cycles dans les graphes orientés et non orientés : plus long cycle, cycles de longueur donnée, hamiltonisme, pancyclisme." Bordeaux 1, 1985. http://www.theses.fr/1985BOR10617.

Full text

Abstract:

Etude des cycles d'un graphe oriente ou non, satisfaisant des conditions sur divers parametres : stabilite, connexite, degre minimum, nombre d'aretes. Problemes concernant la longueur maximum d'un cycle, l'hamiltonisme, le pancyclisme, la couverture des sommets du graphe par des cycles de longueur fixee. Problemes algorithmiques

APA, Harvard, Vancouver, ISO, and other styles

46

Adamus, Lech. "Sufficient conditions for existence of long cycles in graphs." Paris 11, 2008. http://www.theses.fr/2008PA112203.

Full text

Abstract:

Le but de cette thèse est de présenter des conditions suffisantes pour l'existence de longs cycles dans les graphes simples et les graphes orientés, c'est à dire des cycles passant par plus de la moitié des sommets d'un graphe donné. Plus précisément, nous voulons trouver la taille minimale d'un graphe donné G garantissant qu'un cycle de longueur prescrite est contenu dans G. On pourra considérer une modification de cette condition en ajoutant une borne sur le degré minimum de G. Nous étudions ce problème pour les graphes simples, en particulier les graphes bipartis et aussi les graphes orient

APA, Harvard, Vancouver, ISO, and other styles

47

Kadi, Abderrezzak Mohamed El. "Existence de cycles dans les graphes bipartis et dans plusieurs familles de graphes généralisant la classe des graphes sans K₁,₃." Paris 11, 1999. http://www.theses.fr/1999PA112401.

Full text

Abstract:

Dans cette thèse, nous apportons une contribution à l'étude de l'existence de cycles de longueur donnée dans certaines familles de graphes. La thèse se divise en deux parties. La première partie est dédiée aux graphes bipartis. Nous nous y intéressons aux graphes bipartis équilibrés hamiltoniens, bipancycliques, S-cyclables et S-pancyclables. Les conditions envisagées portent sur les degrés, le nombre d'indépendance biparti et la k-bifermeture. La seconde partie concerne les graphes sans K₁,₃ que nous appellerons aussi graphes "claw-free". On examine dans cette partie plusieurs familles de gra

APA, Harvard, Vancouver, ISO, and other styles

48

Jurkiewicz, Samuel. "Theorie des graphes : cycles hamiltoniens, coloration d'aretes et problemes de pavages." Paris 6, 1996. http://www.theses.fr/1996PA066206.

Full text

Abstract:

Ce travail aborde dans trois parties trois problemes de la theorie des graphes. Dans la premiere partie, cycles hamiltoniens et graphes planaires, nous developpons une procedure de construction de certaines familles de graphes planaires 3-connexes, hamiltoniens et non hamiltoniens. Ces graphes echappent aux caracterisations donnees par les theoremes de tutte et whitney d'une part (conditions suffisantes) et par le theoreme de grinberg d'autre part (conditions necessaires). Cette procedure s'avere utile pour la production d'exemples de graphes en vue de tester des heuristiques pour trouver des

APA, Harvard, Vancouver, ISO, and other styles

49

Fernandes, Antonio M. "A study of nonlinear physical systems in generalized phase space." Virtual Press, 1996. http://liblink.bsu.edu/uhtbin/catkey/1020161.

Full text

Abstract:

Classical mechanics provides a phase space representation of mechanical systems in terms of position and momentum state variables. The Hamiltonian system, a set of partial differential equations, defines a vector field in phase space and uniquely determines the evolutionary process of the system given its initial state.A closed form solution describing system trajectories in phase space is only possible if the system of differential equations defining the Hamiltonian is linear. For nonlinear cases approximate and qualitative methods are required.Generalized phase space methods do not confine s

APA, Harvard, Vancouver, ISO, and other styles

50

Chen, Ching-Hui, and 陳青輝. "The study of strongly k-edge Hamiltonian graphs and Hamiltonian laceable graph." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/12297631035456645346.

Full text

Abstract:

碩士<br>大葉大學<br>資訊工程學系碩士班<br>92<br>An interconnection network is the structure that connects the processors of parallel computer. The hypercube and star networks are the most fundamental topologies for interconnection networks. There are many researches based on these two topologies. Fault tolerance is also an important issue especially when the number of processors that in the interconnection network is large. In this thesis, we study the fault tolerance properties in hypercube and other bipartite graphs. We major in link failures. 　　In this thesis, we introduce the Hamiltonian graph

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!