Log in

Relevant bibliographies by topics / Graph theory. Hamiltonian graph theory / Dissertations / Theses

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

Dissertations / Theses on the topic 'Graph theory. Hamiltonian graph theory'

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

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 'Graph theory. Hamiltonian 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.

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

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

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

3

Smithers, Dayna Brown. "Graph Theory for the Secondary School Classroom." Digital Commons @ East Tennessee State University, 2005. https://dc.etsu.edu/etd/1015.

Full text

Abstract:

After recognizing the beauty and the utility of Graph Theory in solving a variety of problems, the author decided that it would be a good idea to make the subject available for students earlier in their educational experience. In this thesis, the author developed four units in Graph Theory, namely Vertex Coloring, Minimum Spanning Tree, Domination, and Hamiltonian Paths and Cycles, which are appropriate for high school level.

APA, Harvard, Vancouver, ISO, and other styles

4

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

5

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

6

Steelman, Andrea Elizabeth. "Degree sum ensuring hamiltonicity." [Pensacola, Fla.] : University of West Florida, 2007. http://purl.fcla.edu/fcla/etd/WFE0000012.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

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

8

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

9

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

10

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

11

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

12

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

13

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

14

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

15

Johnson, Chase R. "Molecular Graph Theory." Digital WPI, 2010. https://digitalcommons.wpi.edu/etd-theses/1179.

Full text

Abstract:

Graph Theory is a branch of mathematics that has a wealth of applications to other science and engineering disciplines, specifically Chemistry. The primary application of graphs to Chemistry is related to understanding of structure and symmetry at the molecular level. By projecting a molecule to the plane and examining it as a graph, a lot can be learned about the underlying molecular structure of a given compound. Using concepts of Graph Theory this masters project examines the underlying structures of two specific families of compounds, fullerenes and zeolites, from a chemical and mathematic

APA, Harvard, Vancouver, ISO, and other styles

16

Feghali, Carl. "Topics in graph colouring and extremal graph theory." Thesis, Durham University, 2016. http://etheses.dur.ac.uk/11790/.

Full text

Abstract:

In this thesis we consider three problems related to colourings of graphs and one problem in extremal graph theory. Let $G$ be a connected graph with $n$ vertices and maximum degree $\Delta(G)$. Let $R_k(G)$ denote the graph with vertex set all proper $k$-colourings of $G$ and two $k$-colourings are joined by an edge if they differ on the colour of exactly one vertex. Our first main result states that $R_{\Delta(G)+1}(G)$ has a unique non-trivial component with diameter $O(n^2)$. This result can be viewed as a reconfigurations analogue of Brooks' Theorem and completes the study of reconfigurat

APA, Harvard, Vancouver, ISO, and other styles

17

Nikwigize, Adolphe. "Graph theory : Route problems." Thesis, Linnéuniversitetet, Institutionen för datavetenskap, fysik och matematik, DFM, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-17397.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Berg, Deborah. "Connections Between Voting Theory and Graph Theory." Scholarship @ Claremont, 2005. https://scholarship.claremont.edu/hmc_theses/178.

Full text

Abstract:

Mathematical concepts have aided the progression of many different fields of study. Math is not only helpful in science and engineering, but also in the humanities and social sciences. Therefore, it seemed quite natural to apply my preliminary work with set intersections to voting theory, and that application has helped to focus my thesis. Rather than studying set intersections in general, I am attempting to study set intersections and what they mean in a voting situation. This can lead to better ways to model preferences and to predict which campaign platforms will be most popular. Because I

APA, Harvard, Vancouver, ISO, and other styles

19

Keevash, Peter. "Topics in extremal graph theory." Thesis, University of Cambridge, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.619938.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Law, Ka-ho, and 羅家豪. "Some results in graph theory." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2010. http://hub.hku.hk/bib/B44899816.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Morrison, Julie Lindsay. "Computational graph theory in bioinformatics." Thesis, University of Strathclyde, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.435114.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Richer, Duncan Christopher. "Graph theory and combinatorial games." Thesis, University of Cambridge, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.621916.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Nieh, Ari. "Fractional Analogues in Graph Theory." Scholarship @ Claremont, 2001. https://scholarship.claremont.edu/hmc_theses/131.

Full text

Abstract:

Tait showed in 1878 that the Four Color Theorem is equivalent to being able to three-color the edges of any planar, three-regular, two-edge connected graph. Not surprisingly, this equivalent problem proved to be equally difficult. We consider the problem of fractional colorings, which resemble ordinary colorings but allow for some degree of cheating. Happily, it is known that every planar three-regular, two-edge connected graph is fractionally three-edge colorable. Is there an analogue to Tait’s Theorem which would allow us to derive the Fractional Four Color Theorem from this edge-coloring re

APA, Harvard, Vancouver, ISO, and other styles

24

Eggemann, Nicole. "Some applications of graph theory." Thesis, Brunel University, 2009. http://bura.brunel.ac.uk/handle/2438/3953.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Hatt, Justin Dale. "Online assessment of graph theory." Thesis, Brunel University, 2016. http://bura.brunel.ac.uk/handle/2438/13389.

Full text

Abstract:

The objective of this thesis is to establish whether or not online, objective questions in elementary graph theory can be written in a way that exploits the medium of computer-aided assessment. This required the identification and resolution of question design and programming issues. The resulting questions were trialled to give an extensive set of answer files which were analysed to identify whether computer delivery affected the questions in any adverse ways and, if so, to identify practical ways round these issues. A library of questions spanning commonly-taught topics in elementary graph t

APA, Harvard, Vancouver, ISO, and other styles

26

Letzter, Shoham. "Extremal graph theory with emphasis on Ramsey theory." Thesis, University of Cambridge, 2015. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.709415.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Knight, Christopher J. "Hydrogen bond topology order/disorder transitions in ice and the behavior of defects in a disordered ice lattice /." Columbus, Ohio : Ohio State University, 2009. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1236788109.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Bessy, Stéphane. "Some problems in graph theory and graphs algorithmic theory." Habilitation à diriger des recherches, Université Montpellier II - Sciences et Techniques du Languedoc, 2012. http://tel.archives-ouvertes.fr/tel-00806716.

Full text

Abstract:

This document is a long abstract of my research work, concerning graph theory and algorithms on graphs. It summarizes some results, gives ideas of the proof for some of them and presents the context of the different topics together with some interesting open questions connected to them The first part precises the notations used in the rest of the paper; the second part deals with some problems on cycles in digraphs; the third part is an overview of two graph coloring problems and one problem on structures in colored graphs; finally the fourth part focus on some results in algorithmic graph the

APA, Harvard, Vancouver, ISO, and other styles

29

Anderson, Jon K. "Genetic algorithms applied to graph theory." Virtual Press, 1999. http://liblink.bsu.edu/uhtbin/catkey/1136714.

Full text

Abstract:

This thesis proposes two new variations on the genetic algorithm. The first attempts to improve clustering problems by optimizing the structure of a genetic string dynamically during the run of the algorithm. This is done by using a permutation on the allele which is inherited by the next generation. The second is a multiple pool technique which ensures continuing convergence by maintaining unique lineages and merging pools of similar age. These variations will be tested against two well-known graph theory problems, the Traveling Salesman Problem and the Maximum Clique Problem. The results wil

APA, Harvard, Vancouver, ISO, and other styles

30

Peng, Richard. "Algorithm Design Using Spectral Graph Theory." Research Showcase @ CMU, 2013. http://repository.cmu.edu/dissertations/277.

Full text

Abstract:

Spectral graph theory is the interplay between linear algebra and combinatorial graph theory. Laplace’s equation and its discrete form, the Laplacian matrix, appear ubiquitously in mathematical physics. Due to the recent discovery of very fast solvers for these equations, they are also becoming increasingly useful in combinatorial optimization, computer vision, computer graphics, and machine learning. In this thesis, we develop highly efficient and parallelizable algorithms for solving linear systems involving graph Laplacian matrices. These solvers can also be extended to symmetric diagonally

APA, Harvard, Vancouver, ISO, and other styles

31

Islam, Mustafa R. "A hypertext graph theory reference system." Virtual Press, 1993. http://liblink.bsu.edu/uhtbin/catkey/879844.

Full text

Abstract:

G-Net system is being developed by the members of the G-Net research group under the supervision of Dr. K. Jay Bagga. The principle objective of the G-Net system is to provide an integrated tool for dealing with various aspects of graph theory. G-Net system is divided into two parts. GETS (Graph theory Experiments Tool Set) will provide a set of tools to experiment with graph theory, and HYGRES (HYpertext Graph theory Reference Service), the second subcomponent of the G-Net system to aid graph theory study and research. In this research a hypertext application is built to present the graph the

APA, Harvard, Vancouver, ISO, and other styles

32

Edwards, C. S. "Some extremal problems in graph theory." Thesis, University of Reading, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.373467.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Florkowski, Stanley F. "Spectral graph theory of the Hypercube." Thesis, Monterey, Calif. : Naval Postgraduate School, 2008. http://edocs.nps.edu/npspubs/scholarly/theses/2008/Dec/08Dec%5FFlorkowski.pdf.

Full text

Abstract:

Thesis (M.S. in Applied Mathematics)--Naval Postgraduate School, December 2008.<br>Thesis Advisor(s): Rasmussen, Craig W. "December 2008." Description based on title screen as viewed on January 29, 2009. Includes bibliographical references (p. 51-52). Also available in print.

APA, Harvard, Vancouver, ISO, and other styles

34

Robinson, Laura Ann. "Graph Theory for the Middle School." Digital Commons @ East Tennessee State University, 2006. https://dc.etsu.edu/etd/2226.

Full text

Abstract:

After being introduced to graph theory and realizing how it can be utilized to solve real-world problems, the author decided to create modules of study on graph theory appropriate for middle school students. In this thesis, four modules were developed in the area of graph theory: an Introduction to Terms and Definitions, Graph Families, Graph Operations, and Graph Coloring. It is written as a guide for middle school teachers to prepare teaching units on graph theory.

APA, Harvard, Vancouver, ISO, and other styles

35

Garbe, Frederik. "Extremal graph theory via structural analysis." Thesis, University of Birmingham, 2018. http://etheses.bham.ac.uk//id/eprint/8869/.

Full text

Abstract:

We discuss two extremal problems in extremal graph theory. First we establish a precise characterisation of 4-uniform hypergraphs with minimum codegree close to n/2 which contain a Hamilton 2-cycle. As a corollary we determine the exact Dirac threshold for Hamilton 2-cycles in 4-uniform hypergraphs, and we provide a polynomial-time algorithm which answers the corresponding decision problem for 4-graphs with minimum degree close to n/2. In contrast we also show that the corresponding decision problem for tight Hamilton cycles in dense k-graphs is NP-complete. Furthermore we study the following

APA, Harvard, Vancouver, ISO, and other styles

36

Grinshpun, Andrey Vadim. "Some problems in Graph Ramsey Theory." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/97767.

Full text

Abstract:

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2015.<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 149-156).<br>A graph G is r-Ramsey minimal with respect to a graph H if every r-coloring of the edges of G yields a monochromatic copy of H, but the same is not true for any proper subgraph of G. The study of the properties of graphs that are Ramsey minimal

APA, Harvard, Vancouver, ISO, and other styles

37

Parks, David J. "Graph theory in America, 1876-1950." Thesis, Open University, 2012. http://oro.open.ac.uk/54663/.

Full text

Abstract:

This narrative is a history of the contributions made to graph theory in the United States of America by American mathematicians and others who supported the growth of scholarship in that country, between the years 1876 and 1950. The beginning of this period coincided with the opening of the first research university in the United States of America, The Johns Hopkins University (although undergraduates were also taught), providing the facilities and impetus for the development of new ideas. The hiring, from England, of one of the foremost mathematicians of the time provided the necessary motiv

APA, Harvard, Vancouver, ISO, and other styles

38

Loveland, Susan M. "The Reconstruction Conjecture in Graph Theory." DigitalCommons@USU, 1985. https://digitalcommons.usu.edu/etd/7022.

Full text

Abstract:

In this paper we show that specific classes of graphs are reconstructible; we explore the relationship between the. reconstruction and edge-reconstruction conjectures; we prove that several classes of graphs are actually Harary to the reconstructible; and we give counterexamples reconstruction and edge-reconstruction conjectures for infinite graphs.

APA, Harvard, Vancouver, ISO, and other styles

39

Schuerger, Houston S. "Contributions to Geometry and Graph Theory." Thesis, University of North Texas, 2020. https://digital.library.unt.edu/ark:/67531/metadc1707341/.

Full text

Abstract:

In geometry we will consider n-dimensional generalizations of the Power of a Point Theorem and of Pascal's Hexagon Theorem. In generalizing the Power of a Point Theorem, we will consider collections of cones determined by the intersections of an (n-1)-sphere and a pair of hyperplanes. We will then use these constructions to produce an n-dimensional generalization of Pascal's Hexagon Theorem, a classical plane geometry result which states that "Given a hexagon inscribed in a conic section, the three pairs of continuations of opposite sides meet on a straight line." Our generalization of this

APA, Harvard, Vancouver, ISO, and other styles

40

Weaver, Robert Wooddell. "Some problems in structural graph theory /." The Ohio State University, 1986. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487268021746449.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Han, Lin. "Graph generative models from information theory." Thesis, University of York, 2012. http://etheses.whiterose.ac.uk/3726/.

Full text

Abstract:

Generative models are commonly used in statistical pattern recognition to describe the probability distributions of patterns in a vector space. In recent years, sustained by the wide range of mathematical tools available in vector space, many algorithms for constructing generative models have been developed. Compared with the advanced development of the generative model for vectors, the development of a generative model for graphs has had less progress. In this thesis, we aim to solve the problem of constructing the generative model for graphs using information theory. Given a set of sample gr

APA, Harvard, Vancouver, ISO, and other styles

42

Pappone, Francesco. "Graph neural networks: theory and applications." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2021. http://amslaurea.unibo.it/23893/.

Full text

Abstract:

Le reti neurali artificiali hanno visto, negli ultimi anni, una crescita vertiginosa nelle loro applicazioni e nelle architetture dei modelli impiegati. In questa tesi introduciamo le reti neurali su domini euclidei, in particolare mostrando l’importanza dell’equivarianza di traslazione nelle reti convoluzionali, e introduciamo, per analogia, un’estensione della convoluzione a dati strutturati come grafi. Inoltre presentiamo le architetture dei principali Graph Neural Network ed esponiamo, per ognuna delle tre architetture proposte (Spectral graph Convolutional Network, Graph Co

APA, Harvard, Vancouver, ISO, and other styles

43

Yi, Peipei. "Graph query autocompletion." HKBU Institutional Repository, 2018. https://repository.hkbu.edu.hk/etd_oa/557.

Full text

Abstract:

The prevalence of graph-structured data in modern real-world applications has led to a rejuvenation of research on graph data management and analytics. Several database query languages have been proposed for textually querying graph databases. Unfortunately, formulating a graph query using any of these query languages often demands considerable cognitive effort and requires "programming" skill at least similar to programming in SQL. Yet, in a wide spectrum of graph applications consumers need to query graph data but are not proficient query writers. Hence, it is important to devise intuitive t

APA, Harvard, Vancouver, ISO, and other styles

44

Hegde, Rajneesh. "New Tools and Results in Graph Structure Theory." Diss., Georgia Institute of Technology, 2006. http://hdl.handle.net/1853/10481.

Full text

Abstract:

We first prove a ``non-embeddable extensions' theorem for polyhedral graph embeddings. Let G be a ``weakly 4-connected' planar graph. We describe a set of constructions that produce a finite list of non-planar graphs, each having a minor isomorphic to G, such that every non-planar weakly 4-connected graph H that has a minor isomorphic to G has a minor isomorphic to one of the graphs in the list. The theorem is more general and applies in particular to polyhedral embeddings in any surface. We discuss an approach to proving Jorgensen's conjecture, which states that if G is a 6-connected graph w

APA, Harvard, Vancouver, ISO, and other styles

45

Waterhouse, Mary Alexandra Paula Royston Hastilow. "Coloured graph decompositions /." [St. Lucia, Qld.], 2005. http://www.library.uq.edu.au/pdfserve.php?image=thesisabs/absthe18769.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Burns, Jonathan. "Recursive Methods in Number Theory, Combinatorial Graph Theory, and Probability." Scholar Commons, 2014. https://scholarcommons.usf.edu/etd/5193.

Full text

Abstract:

Recursion is a fundamental tool of mathematics used to define, construct, and analyze mathematical objects. This work employs induction, sieving, inversion, and other recursive methods to solve a variety of problems in the areas of algebraic number theory, topological and combinatorial graph theory, and analytic probability and statistics. A common theme of recursively defined functions, weighted sums, and cross-referencing sequences arises in all three contexts, and supplemented by sieving methods, generating functions, asymptotics, and heuristic algorithms. In the area of number theory, this

APA, Harvard, Vancouver, ISO, and other styles

47

Fiala, Nick C. "Some topics in combinatorial design theory and algebraic graph theory /." The Ohio State University, 2002. http://rave.ohiolink.edu/etdc/view?acc_num=osu1486402957198077.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Narayanan, Bhargav. "Problems in Ramsey theory, probabilistic combinatorics and extremal graph theory." Thesis, University of Cambridge, 2015. https://www.repository.cam.ac.uk/handle/1810/252850.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Srikanthan, T. "Bond graph analysis." Thesis, Coventry University, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.373896.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Chen, Xujin, and 陳旭瑾. "Graph partitions and integer flows." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2004. http://hub.hku.hk/bib/B30286256.

Full text

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!