Log in

Relevant bibliographies by topics / Relations with graph theory / Dissertations / Theses

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

Dissertations / Theses on the topic 'Relations with graph theory'

Author: Grafiati

Published: 4 June 2021

Last updated: 28 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 'Relations with 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

Dube, Matthew P. "An Embedding Graph for 9-Intersection Topological Spatial Relations." Fogler Library, University of Maine, 2009. http://www.library.umaine.edu/theses/pdf/DubeMP2009.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Lucas, Claire. "Trois essais sur les relations entre les invariants structuraux des graphes et le spectre du Laplacien sans signe." Phd thesis, Ecole Polytechnique X, 2013. http://pastel.archives-ouvertes.fr/pastel-00956183.

Full text

Abstract:

Le spectre du Laplacien sans signe a fait l'objet de beaucoup d'attention dans la communauté scientifique ces dernières années. La principale raison est l'intuition, basée sur une étude des petits graphes et sur des propriétés valides pour des graphes de toutes tailles, que plus de graphes sont déterminés par le spectre de cette matrice que par celui de la matrice d'adjacence et du Laplacien. Les travaux présentés dans cette thèse ont apporté des éléments nouveaux sur les informations contenues dans le spectre cette matrice. D'une part, on y présente des relations entre les invariants de struc

APA, Harvard, Vancouver, ISO, and other styles

3

Zhou, Xinwei. "Reachability relations in selective regression testing." Thesis, London South Bank University, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.265281.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Sun, Pak Kiu. "Incidence coloring : origins, developments and relation with other colorings." HKBU Institutional Repository, 2007. http://repository.hkbu.edu.hk/etd_ra/826.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Perissinotti, Bisoni Roberta. "Relations among Shakespeare's characters: an analysis in terms of centrality measures and new tecniques from graph theory." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2017. http://amslaurea.unibo.it/15001/.

Full text

Abstract:

This work analyzes some aspects of two problems in graph theory: centrality measures that allow us to detect the most important group of nodes in a network and the clustering of a graph in coherent sub-communities. We propose two new centrality measures that are the results of a new point of view and we suggest a new algorithm to detect communities. We apply all the results to analyze drama, in particular five Shakespeare's plays.

APA, Harvard, Vancouver, ISO, and other styles

6

Kwok, Wing-hong, and 郭永康. "Streamlined and prioritized hierarchical relations: a technique for improving the effectiveness of theclassification-tree methodology." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2001. http://hub.hku.hk/bib/B2975107X.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Knight, Daniel William. "Reactor behavior and its relation to chemical reaction network structure." The Ohio State University, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=osu1438274630.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Racataian, Valentin Jean. "Various Steiner Systems." CSUSB ScholarWorks, 2004. https://scholarworks.lib.csusb.edu/etd-project/2574.

Full text

Abstract:

This project deals with the automorphism group G of a Steiner system S (3, 4, 10). S₁₀, the symmetrical group of degree 10, acts transitively on T, the set of all Steiner systems with parameters 3, 4, 10. The purpose of this project is to study the action of S₁₀ on cosets of G. This will be achieved by means of a graph of S₁₀ on T x T. The orbits of S₁₀ on T x T are in one-one correspondence with the orbits of G, the stabilizer of an S [e] T on T.

APA, Harvard, Vancouver, ISO, and other styles

9

Silva, Marcel Kenji de Carli. "Relações min-max em otimização combinatória." Universidade de São Paulo, 2007. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-08052007-182205/.

Full text

Abstract:

Relações min-max são objetos centrais em otimização combinatória. Elas basicamente afirmam que, numa dada estrutura, o valor ótimo de um certo problema de minimização é igual ao valor ótimo de um outro problema de maximização. Relações desse tipo fornecem boas caracterizações e descrições poliédricas para diversos problemas importantes, além de geralmente virem acompanhadas de algoritmos eficientes para os problemas em questão. Muitas vezes, tais algoritmos eficientes são obtidos naturalmente das provas construtivas dessas relações; mesmo quando isso não ocorre, essas relações revelam o sufici

APA, Harvard, Vancouver, ISO, and other styles

10

Maturana, Miranda Francisco Ramón Javier. "Le système des villes moyennes du sud du Chili, vers la construction de nouveaux espaces de relations ?" Thesis, Paris 4, 2012. http://www.theses.fr/2012PA040082.

Full text

Abstract:

La question des villes moyennes ou intermédiaires a été largement débattue, en raison de la difficulté à établir leur définition. Un système de villes moyennes particulier est situé au sud du Chili, constitué par les régions de La Araucanía, Los Ríos et Los Lagos. Ce système présente une configuration spatiale plutôt monocentrique, où les interactions entre villes sont développées à l'intérieur de chaque région et, par conséquence, les liens transfrontaliers sont faibles voire inexistants. Les centres urbains à l'intérieur de chaque région développent différents types de configuration spatiale

APA, Harvard, Vancouver, ISO, and other styles

11

Joret, Gwenaël. "Entropy and stability in graphs." Doctoral thesis, Universite Libre de Bruxelles, 2007. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210605.

Full text

Abstract:

Un stable (ou ensemble indépendant) est un ensemble de sommets qui sont deux à deux non adjacents. De nombreux résultats classiques en optimisation combinatoire portent sur le nombre de stabilité (défini comme la plus grande taille d'un stable), et les stables se classent certainement parmi les structures les plus simples et fondamentales en théorie des graphes.<p><p>La thèse est divisée en deux parties, toutes deux liées à la notion de stables dans un graphe. Dans la première partie, nous étudions un problème de coloration de graphes, c'est à dire de partition en stables, où le but est de min

APA, Harvard, Vancouver, ISO, and other styles

12

Ruoppolo, Domenico. "Relational graph models and Morris's observability : resource-sensitive semantic investigations on the untyped λ-calculus". Thesis, Sorbonne Paris Cité, 2016. http://www.theses.fr/2016USPCD069/document.

Full text

Abstract:

La thèse contribue à l’étude du λ-calcul non-typé de Church, un système de réécriture dont la règle principale est la β-réduction (formalisant l’exécution d’un programme). Nous nous concentrons sur la sémantique dénotationnelle, l’étude de modèles du λ-calcul interprétant de la même façon les λ-termes β-convertibles. On examine la sémantique relationnelle, une sémantique sensible aux ressources qui interprète les λ-termes comme des relations avec les entrées regroupées en multi-ensembles. Nous définissons une classe de modèles relationnels, les modèles de graphe relationnels (rgm’s), que nous

APA, Harvard, Vancouver, ISO, and other styles

13

Faiz, Tariq Nadeem. "Deadlock detection and avoidance for a class of manufacturing systems." Ohio : Ohio University, 1996. http://www.ohiolink.edu/etd/view.cgi?ohiou1178654511.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Necşulescu, Silvia. "Automatic acquisition of lexical-semantic relations: gathering information in a dense representation." Doctoral thesis, Universitat Pompeu Fabra, 2016. http://hdl.handle.net/10803/374234.

Full text

Abstract:

Lexical-semantic relationships between words are key information for many NLP tasks, which require this knowledge in the form of lexical resources. This thesis addresses the acquisition of lexical-semantic relation instances. State of the art systems rely on word pair representations based on patterns of contexts where two related words co-occur to detect their relation. This approach is hindered by data sparsity: even when mining very large corpora, not every semantically related word pair co-occurs or not frequently enough. In this work, we investigate novel representations to predict if tw

APA, Harvard, Vancouver, ISO, and other styles

15

Cavalheiro, Simone André da Costa. "Relational approach of graph grammars." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2010. http://hdl.handle.net/10183/25516.

Full text

Abstract:

Gramática de grafos é uma linguagem formal bastante adequada para sistemas cujos estados possuem uma topologia complexa (que envolvem vários tipos de elementos e diferentes tipos de relações entre eles) e cujo comportamento é essencialmente orientado pelos dados, isto é, eventos são disparados por configurações particulares do estado. Vários sistemas reativos são exemplos desta classe de aplicações, como protocolos para sistemas distribuídos e móveis, simulação de sistemas biológicos, entre outros. A verificação de gramática de grafos através da técnica de verificação de modelos já é utilizada

APA, Harvard, Vancouver, ISO, and other styles

16

Vernhes, Gabriel. "Les relations entre sciences, technologies et territoires au cœur de la souveraineté nationale : une approche structurale sur longue période." Electronic Thesis or Diss., Institut polytechnique de Paris, 2024. http://www.theses.fr/2024IPPAE002.

Full text

Abstract:

Cette thèse explore la dimension territoriale des échanges de connaissances scientifiques et technologiques essentiels au processus d'innovation sur des domaines technologiques intéressant la défense, tels que l'armement, l'équipement aérospatial et l'impression 3D. Elle explore l'intégration des avancées scientifiques dans le développement technologique et analyse l'autonomie stratégique des territoires en tant que capacité à produire, utiliser et diffuser des connaissances de manière indépendante. Cette autonomie dans les secteurs stratégiques de l'innovation de défense est au coeur des enje

APA, Harvard, Vancouver, ISO, and other styles

17

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

18

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

19

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

20

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

21

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

22

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

23

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

24

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

25

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

26

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

27

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

28

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

29

Long, Yangjing. "Graph Relations and Constrained Homomorphism Partial Orders." Doctoral thesis, Universitätsbibliothek Leipzig, 2014. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-154281.

Full text

Abstract:

We consider constrained variants of graph homomorphisms such as embeddings, monomorphisms, full homomorphisms, surjective homomorpshims, and locally constrained homomorphisms. We also introduce a new variation on this theme which derives from relations between graphs and is related to multihomomorphisms. This gives a generalization of surjective homomorphisms and naturally leads to notions of R-retractions, R-cores, and R-cocores of graphs. Both \\mbox{R-cores} and R-cocores of graphs are unique up to isomorphism and can be computed in polynomial time. The theory of the graph homomorphism ord

APA, Harvard, Vancouver, ISO, and other styles

30

Edström, August, and Johan Isaksson. "Inferring Dataset Relations using Knowledge Graph Metadata." Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-414918.

Full text

Abstract:

The web site dataportalen.se aims to increase the availability of Swedish open datasets. This is achieved by collecting metadata about the open datasets provided by Swedish organizations. At the time of writing, metadata from more than two thousand datasets reside in the portal, and this number is set to increase. As the number of datasets increases, browsing for relevant information becomes increasingly difficult and time-consuming. The web site supports searching using text and then filtering the results by theme, organization, file format och license. We believe that there exists potential

APA, Harvard, Vancouver, ISO, and other styles

31

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

32

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

33

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

34

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

35

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

36

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

37

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

38

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

39

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

40

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

41

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

42

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

43

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

44

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

45

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

46

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

47

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

48

Lopez, Christian P. "On the relationship between a graph and the cycle graph of its complement." Thesis, Edith Cowan University, Research Online, Perth, Western Australia, 1995. https://ro.ecu.edu.au/theses/1184.

Full text

Abstract:

From an arbitrary graph G, another graph called the cycle graph of G and denoted by C(G) can be derived. The cycle graph C(G) of G has as its vertices the chordless cycles of G and two vertices in C(G) are adjacent if and only if the corresponding chordless cycles have at least one edge in common.

APA, Harvard, Vancouver, ISO, and other styles

49

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

50

Morisi, Rita. "Graph–based techniques and spectral graph theory in control and machine learning." Thesis, IMT Alti Studi Lucca, 2016. http://e-theses.imtlucca.it/188/1/Morisi_phdthesis.pdf.

Full text

Abstract:

Graphs are powerful data structure for representing objects and their relationships. They are extremely useful in the study of dynamical systems, evaluating how different agents interact among each other and behave. An example is represented by the consensus problem where a graph models a set of agents that locally interact and exchange their opinions with the aim of reaching a common opinion (consensus state). At the same time, many learning techniques rely on graphs exploiting their potentialities in modeling the relationships between data and determining additional features relate

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!