Log in

Relevant bibliographies by topics / Application of graph theory

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Application of graph theory'

Author: Grafiati

Published: 4 June 2021

Last updated: 5 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Application of graph theory.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Application of graph theory"

1

Dairina, M. Ihsan, and M. Ramli. "Interactive graph constructing on graph theory application development." Journal of Physics: Conference Series 948 (January 2018): 012064. http://dx.doi.org/10.1088/1742-6596/948/1/012064.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Akram, Muhammad, Wieslaw A. Dudek, and M. Murtaza Yousaf. "Regularity in Vague Intersection Graphs and Vague Line Graphs." Abstract and Applied Analysis 2014 (2014): 1–10. http://dx.doi.org/10.1155/2014/525389.

Full text

Abstract:

Fuzzy graph theory is commonly used in computer science applications, particularly in database theory, data mining, neural networks, expert systems, cluster analysis, control theory, and image capturing. A vague graph is a generalized structure of a fuzzy graph that gives more precision, flexibility, and compatibility to a system when compared with systems that are designed using fuzzy graphs. In this paper, we introduce the notion of vague line graphs, and certain types of vague line graphs and present some of their properties. We also discuss an example application of vague digraphs.

APA, Harvard, Vancouver, ISO, and other styles

3

Piperski, Alexander. "An application of graph theory to linguistic complexity." Yearbook of the Poznan Linguistic Meeting 1, no. 1 (December 1, 2014): 89–102. http://dx.doi.org/10.1515/yplm-2015-0005.

Full text

Abstract:

Abstract This article introduces a new measure of linguistic complexity which is based on the dual nature of the linguistic sign. Complexity is analyzed as consisting of three components, namely the conceptual complexity (complexity of the signified), the formal complexity (complexity of the signifier) and the form-meaning correspondence complexity. I describe a way of plotting the form-meaning relationship on a graph with two tiers (the form tier and the meaning tier) and apply a complexity measure from graph theory (average vertex degree) to assess the complexity of such graphs. The proposed method is illustrated by estimating the complexity of full noun phrases (determiner + adjective + noun) in English, Swedish, and German. I also mention the limitations and the problems which might arise when using this method.

APA, Harvard, Vancouver, ISO, and other styles

4

Szmytkie, Robert. "Application of graph theory to the morphological analysis of settlements." Quaestiones Geographicae 36, no. 4 (December 1, 2017): 65–80. http://dx.doi.org/10.1515/quageo-2017-0036.

Full text

Abstract:

Abstract In the following paper, the analyses of morphology of settlements were conducted using graph methods. The intention of the author was to create a quantifiable and simple measure, which, in a quantitative way, would express the degree of development of a graph (the spatial pattern of settlement). When analysing examples of graphs assigned to a set of small towns and large villages, it was noticed that the graph development index should depend on: a relative number of edges in relation to the number of nodes (β index), the number of cycles (urban blocks), which evidences the complexity of the spatial pattern of settlement, and the average rank of nodes of a graph, which expresses the degree of complexity of a street network.

APA, Harvard, Vancouver, ISO, and other styles

5

Coufal, Petr, Štěpán Hubálovský, and Marie Hubálovská. "Application of Basic Graph Theory in Autonomous Motion of Robots." Mathematics 9, no. 9 (April 21, 2021): 919. http://dx.doi.org/10.3390/math9090919.

Full text

Abstract:

Discrete mathematics covers the field of graph theory, which solves various problems in graphs using algorithms, such as coloring graphs. Part of graph theory is focused on algorithms that solve the passage through mazes and labyrinths. This paper presents a study conducted as part of a university course focused on graph theory. The course addressed the problem of high student failure in the mazes and labyrinths chapter. Students’ theoretical knowledge and practical skills in solving algorithms in the maze were low. Therefore, the use of educational robots and their involvement in the teaching of subjects in part focused on mazes and labyrinths. This study shows an easy passage through the individual areas of teaching the science, technology, engineering, and mathematics (STEM) concept. In this article, we describe the research survey and focus on the description and examples of teaching in a university course. Part of the work is the introduction of an easy transition from the theoretical solution of algorithms to their practical implementation on a real autonomous robot. The theoretical part of the course introduced the issues of graph theory and basic algorithms for solving the passage through the labyrinth. The contribution of this study is a change in the approach to teaching graph theory and a greater interconnection of individual areas of STEM to achieve better learning outcomes for science students.

APA, Harvard, Vancouver, ISO, and other styles

6

Islam, Sk Rabiul, and Madhumangal Pal. "Hyper-Wiener index for fuzzy graph and its application in share market." Journal of Intelligent & Fuzzy Systems 41, no. 1 (August 11, 2021): 2073–83. http://dx.doi.org/10.3233/jifs-210736.

Full text

Abstract:

Topological indices have an important role in molecular chemistry, network theory, spectral graph theory and several physical worlds. Most of the topological indices are defined in a crisp graph. As fuzzy graphs are more generalization of crisp graphs, those indices have more application in fuzzy graphs also. In this article, we introduced the fuzzy hyper-Wiener index (FHWI) and studied this index for various fuzzy graphs like path, cycle, star, etc and provided some interesting bounds of FHWI for that fuzzy graph. A lower bound of FHWI is established for n-vertex connected fuzzy graph depending on strength of a strong edges. A relation between FHWI of a tree and its maximum spanning tree is established and this index is calculated for the saturated cycle. Also, at the end of the article, an application in the share market of this index is presented.

APA, Harvard, Vancouver, ISO, and other styles

7

Sebastian, Arya, John N. Mordeson, and Sunil Mathew. "Generalized Fuzzy Graph Connectivity Parameters with Application to Human Trafficking." Mathematics 8, no. 3 (March 16, 2020): 424. http://dx.doi.org/10.3390/math8030424.

Full text

Abstract:

Graph models are fundamental in network theory. But normalization of weights are necessary to deal with large size networks like internet. Most of the research works available in the literature have been restricted to an algorithmic perspective alone. Not much have been studied theoretically on connectivity of normalized networks. Fuzzy graph theory answers to most of the problems in this area. Although the concept of connectivity in fuzzy graphs has been widely studied, one cannot find proper generalizations of connectivity parameters of unweighted graphs. Generalizations for some of the existing vertex and edge connectivity parameters in graphs are attempted in this article. New parameters are compared with the old ones and generalized values are calculated for some of the major classes like cycles and trees in fuzzy graphs. The existence of super fuzzy graphs with higher connectivity values are established for both old and new parameters. The new edge connectivity values for some wider classes of fuzzy graphs are also obtained. The generalizations bring substantial improvements in fuzzy graph clustering techniques and allow a smooth theoretical alignment. Apart from these, a new class of fuzzy graphs called generalized t-connected fuzzy graphs are studied. An algorithm for clustering the vertices of a fuzzy graph and an application related to human trafficking are also proposed.

APA, Harvard, Vancouver, ISO, and other styles

8

Xue, Hui-Ling, Geng Liu, and Xiao-Hui Yang. "A review of graph theory application research in gears." Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science 230, no. 10 (April 16, 2015): 1697–714. http://dx.doi.org/10.1177/0954406215583321.

Full text

Abstract:

Graph theory has been applied to gear train analysis and synthesis for many years, and it is an effective and systematic modeling approach in the design process of gear transmission. Based on more than 100 references listed in this paper, a review about the graph-based method for kinematic and static force analysis, power flow, and mechanical efficiency computation is presented. The method is based on the concept of fundamental circuit corresponding to a basic epicyclic gear train. A 1-dof epicyclic gear train and a two-stage planetary gear train are used to illustrate the application of this method. Besides, isomorphism identification in the synthesis process and enumeration of 1-dof epicyclic gear train graphs are surveyed particularly. Also, the computerized methods for detection of redundant gears and degenerate structures in epicyclic gear trains are reviewed, respectively.

APA, Harvard, Vancouver, ISO, and other styles

9

Manjula, V. "Graph Applications to Data Structures." Advanced Materials Research 433-440 (January 2012): 3297–301. http://dx.doi.org/10.4028/www.scientific.net/amr.433-440.3297.

Full text

Abstract:

This paper presents a topic on Graph theory and its application to data Structures which I consider basic and useful to students in APPLIED MATHEMATICS and ENGINEERING.This paper gives an elementary introduction of Graph theory and its application to data structures. Elements of Graph theory are indispensable in almost all computer Science areas .It can be used in Some areas such as syntactic analysis, fault detection, diagnosis in computers and minimal path problems. The computer representation and manipulation of graph are also discussed so that certain algorithms can be included .A major theme of this paper is to study Graph theory and its Application to data structures Furthermore I hope the students not only learn the course but also develop their analogy perceive, formulate and to solve mathematical programs Thus Graphs especially trees, binary trees are used widely in the representation of data structures this course one can develop mathematical maturity, ability to understand and create mathematical argumentsMethod of derivation is procedure given in the text books with necessary formulae and their application . Concepts and notations from discrete mathematics are useful in studying and describing objects and problems in branches of computer science, such as computer algorithms, programming languages.

APA, Harvard, Vancouver, ISO, and other styles

10

KAPOOR, SANJIV, and XIANG-YANG LI. "PROXIMITY STRUCTURES FOR GEOMETRIC GRAPHS." International Journal of Computational Geometry & Applications 20, no. 04 (August 2010): 415–29. http://dx.doi.org/10.1142/s0218195910003360.

Full text

Abstract:

In this paper we study proximity graph structures like Delaunay triangulations based on geometric graphs, i.e. graphs which are subgraphs of the complete geometric graph. Given an arbitrary geometric graph G, we define Voronoi diagrams, Delaunay triangulations, relative neighborhood graphs, Gabriel graphs which are related to the graph structure and then study their complexities when G is a general geometric graph or G is some special graph derived from the application area of wireless networks. Besides being of fundamental interest these structures have applications in topology control for wireless networks.

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Application of graph theory"

1

Meek, Darrin Leigh. "On graph approximation heuristics : an application to vertex cover on planar graphs." Thesis, Georgia Institute of Technology, 1991. http://hdl.handle.net/1853/24088.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

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

3

Ferrer, Sumsi Miquel. "Theory and Algorithms on the Median Graph. Application to Graph-based Classification and Clustering." Doctoral thesis, Universitat Autònoma de Barcelona, 2008. http://hdl.handle.net/10803/5788.

Full text

Abstract:

Donat un conjunt d'objectes, el concepte genèric de mediana està deﬁnit com l'objecte amb la suma de distàncies a tot el conjunt, més petita. Sovint, aquest concepte és usat per a obtenir el representant del conjunt.
En el reconeixement estructural de patrons, els grafs han estat usats normalment per a representar objectes complexos. En el domini dels grafs, el concepte de mediana és conegut com median graph. Potencialment, té les mateixes aplicacions que el concepte de mediana per poder ser usat com a representant d'un conjunt de grafs.
Tot i la seva simple deﬁnició i les potencials aplicacions, s'ha demostrat que el seu càlcul és una tasca extremadament complexa. Tots els algorismes existents només han estat capaços de treballar amb conjunts petits de grafs, i per tant, la seva aplicació ha estat limitada en molts casos a usar dades sintètiques sense signiﬁcat real. Així, tot i el seu potencial, ha restat com un concepte eminentment teòric.
L'objectiu principal d'aquesta tesi doctoral és el d'investigar a fons la teoria i l'algorísmica relacionada amb el concepte de medinan graph, amb l'objectiu ﬁnal d'extendre la seva aplicabilitat i lliurar tot el seu potencial al món de les aplicacions reals. Per això, presentem nous resultats teòrics i també nous algorismes per al seu càlcul. Des d'un punt de vista teòric aquesta tesi fa dues aportacions fonamentals. Per una banda, s'introdueix el nou concepte d'spectral median graph. Per altra banda es mostra que certes de les propietats teòriques del median graph poden ser millorades sota determinades condicions. Més enllà de les aportacioncs teòriques, proposem cinc noves alternatives per al seu càlcul. La primera d'elles és una conseqüència directa del concepte d'spectral median graph. Després, basats en les millores de les propietats teòriques, presentem dues alternatives més per a la seva obtenció. Finalment, s'introdueix una nova tècnica per al càlcul del median basat en el mapeig de grafs en espais de vectors, i es proposen dos nous algorismes més.
L'avaluació experimental dels mètodes proposats utilitzant una base de dades semi-artiﬁcial (símbols gràﬁcs) i dues amb dades reals (mollècules i pàgines web), mostra que aquests mètodes són molt més eﬁcients que els existents. A més, per primera vegada, hem demostrat que el median graph pot ser un bon representant d'un conjunt d'objectes utilitzant grans quantitats de dades. Hem dut a terme experiments de classiﬁcació i clustering que validen aquesta hipòtesi i permeten preveure una pròspera aplicació del median graph a un bon nombre d'algorismes d'aprenentatge.
Given a set of objects, the generic concept of median is deﬁned as the object with the smallest sum of distances to all the objects in the set. It has been often used as a good alternative to obtain a representative of the set.
In structural pattern recognition, graphs are normally used to represent structured objects. In the graph domain, the concept analogous to the median is known as the median graph. By extension, it has the same potential applications as the generic median in order to be used as the representative of a set of graphs.
Despite its simple deﬁnition and potential applications, its computation has been shown as an extremely complex task. All the existing algorithms can only deal with small sets of graphs, and its application has been constrained in most cases to the use of synthetic data with no real meaning. Thus, it has mainly remained in the box of the theoretical concepts.
The main objective of this work is to further investigate both the theory and the algorithmic underlying the concept of the median graph with the ﬁnal objective to extend its applicability and bring all its potential to the world of real applications. To this end, new theory and new algorithms for its computation are reported. From a theoretical point of view, this thesis makes two main contributions. On one hand, the new concept of spectral median graph. On the other hand, we show that some of the existing theoretical properties of the median graph can be improved under some speciﬁc conditions. In addition to these theoretical contributions, we propose ﬁve new ways to compute the median graph. One of them is a direct consequence of the spectral median graph concept. In addition, we provide two new algorithms based on the new theoretical properties. Finally, we present a novel technique for the median graph computation based on graph embedding into vector spaces. With this technique two more new algorithms are presented.
The experimental evaluation of the proposed methods on one semi-artiﬁcial and two real-world datasets, representing graphical symbols, molecules and webpages, shows that these methods are much more ecient than the existing ones. In addition, we have been able to proof for the ﬁrst time that the median graph can be a good representative of a class in large datasets. We have performed some classiﬁcation and clustering experiments that validate this hypothesis and permit to foresee a successful application of the median graph to a variety of machine learning algorithms.

APA, Harvard, Vancouver, ISO, and other styles

4

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 Convolutional Network, Graph Attention neTwork) un’applicazione che ne mostri sia il funzionamento che l’importanza. Discutiamo, ulteriormente, l’implementazione di un algoritmo di classificazione basato su due varianti dell’architettura Graph Convolutional Network, addestrato e testato sul dataset PROTEINS, capace di classificare le proteine del dataset in due categorie: enzimi e non enzimi.

APA, Harvard, Vancouver, ISO, and other styles

5

Wengle, Emil. "Modelling Hierarchical Structures in Networks Using Graph Theory : With Application to Knowledge Networks in Graph Curricula." Thesis, Uppsala universitet, Signaler och system, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-415044.

Full text

Abstract:

Community detection is a topic in network theory that involves assigning labels to nodes based on some distance measure or centrality index. Detecting communities within a network can be useful to perform information condensation. In this thesis we explore how to use the approach for pedagogical purposes, and more precisely to condense and visualise the networks of facts, concepts and procedures (also called Knowledge Components (KCs)) that are offered in higher education programmes. In details, we consider one of the most common quantities used to evaluate the goodness of a community classification, which is the concept of modularity. Detecting communities by computing the maximum possible modularity indexes is indeed usually desired, but this approach is generally unavailable because the associated optimisation problem is NP-complete. This is why practitioners use other algorithms, that instead of computing the optimum they rely on various heuristics to find communities: some use modularity directly, some start from the entire graph and divide it repeatedly, and some contain random elements. This thesis investigates the trade-offs of using different community detection algorithms and variations of the concept of modularity first in general terms, and then for the purpose of identifying communities in knowledge graphs associated to higher education programmes, which can be modelled as directed graphs of KCs. We discover, tweaking and applying these algorithms both on synthetic but also field data that the Louvain algorithm is among the better algorithms of those that we considered, which is mostly thanks to its efficiency. It does not produce a full hierarchy, however, so we recommend Fast Newman if hierarchy is important.

APA, Harvard, Vancouver, ISO, and other styles

6

Al-Shimary, Abbas. "Applications of graph theory to quantum computation." Thesis, University of Leeds, 2013. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.608359.

Full text

Abstract:

Systems with topologically ordered ground states are considered to be promising candidates for quantum memories. These systems are characterised by a degenerate ground eigenspace separated by an energy gap from the rest of the spectrum. Consequently, topologically ordered systems are resilient to local noise since local errors are suppressed by the gap. Often, knowledge of the gap is not available and a direct approach to the problem is impractical. The first half of this thesis considers the problem of estimating the energy gap of a general class of Hamiltonians in the thermodynamical limit. In particular, we consider a remarkable result from spectral graph theory known as Cheeger inequalities. Cheeger inequalities give an upper and lower bound on the spectral gap of discrete Laplaeians defined on a graph in terms of the geometric characteristics of the graph. We generalise this approach and we employ it to determine if a given discrete Hamiltonian is gapped or not in the thermodynamic limit. A large class of 2D topologically ordered systems, including the Kitaev toric code, were proven to be unstable against thermal fluctuations. There systems can store information for a finite time known as the memory lifetime. The second half of this thesis will be devoted to investigating possible theoretical ways to extend the lifetime of thc 2D toric code. Firstly, we investigate the effect lattice geometry has on the lifetime of the qubit toric code. Importantly, we demonstrate how lattice geometries can be employed to enhance topological systems with intrinsically biased couplings due to physical implementation. Secondly, we improve the error correction properties and lifetime of the generalised 2D toric code by using charge-modifying domain walls. Specifically, we show that we can inhibit the propagation of anyons by introducing domain walls, provided the masses of the anyon types of the model are imbalanced.

APA, Harvard, Vancouver, ISO, and other styles

7

Rittenhouse, Michelle L. "Properties and Recent Applications in Spectral Graph Theory." VCU Scholars Compass, 2008. http://scholarscompass.vcu.edu/etd/1126.

Full text

Abstract:

There are numerous applications of mathematics, specifically spectral graph theory, within the sciences and many other fields. This paper is an exploration of recent applications of spectral graph theory, including the fields of chemistry, biology, and graph coloring. Topics such as the isomers of alkanes, the importance of eigenvalues in protein structures, and the aid that the spectra of a graph provides when coloring a graph are covered, as well as others.The key definitions and properties of graph theory are introduced. Important aspects of graphs, such as the walks and the adjacency matrix are explored. In addition, bipartite graphs are discussed along with properties that apply strictly to bipartite graphs. The main focus is on the characteristic polynomial and the eigenvalues that it produces, because most of the applications involve specific eigenvalues. For example, if isomers are organized according to their eigenvalues, a pattern comes to light. There is a parallel between the size of the eigenvalue (in comparison to the other eigenvalues) and the maximum degree of the graph. The maximum degree of the graph tells us the most carbon atoms attached to any given carbon atom within the structure. The Laplacian matrix and many of its properties are discussed at length, including the classical Matrix Tree Theorem and Cayley's Tree Theorem. Also, an alternative approach to defining the Laplacian is explored and compared to the traditional Laplacian.

APA, Harvard, Vancouver, ISO, and other styles

8

Simmons, Dayton C. (Dayton Cooper). "Applications of Rapidly Mixing Markov Chains to Problems in Graph Theory." Thesis, University of North Texas, 1993. https://digital.library.unt.edu/ark:/67531/metadc277740/.

Full text

Abstract:

In this dissertation the results of Jerrum and Sinclair on the conductance of Markov chains are used to prove that almost all generalized Steinhaus graphs are rapidly mixing and an algorithm for the uniform generation of 2 - (4k + 1,4,1) cyclic Mendelsohn designs is developed.

APA, Harvard, Vancouver, ISO, and other styles

9

Cohen, Nathann. "Three years of graphs and music : some results in graph theory and its applications." Phd thesis, Université Nice Sophia Antipolis, 2011. http://tel.archives-ouvertes.fr/tel-00645151.

Full text

Abstract:

Cette thèse présente différents aperçus de problèmes de mathématiques discrètes en lien avec la théorie des graphes. Elle s'intéresse en particulier à la coloration de graphes, i.e. l'assignation de couleurs aux sommets (ou arêtes) d'un graphes sous certaines contraintes locales, notamment l'exclusion de motifs. Pour différents types de coloration (choisissabilité des sommets, des arêtes, coloration acyclique ou linéaire, ...), un état de l'art est présenté, accompagné de résultats d'existence sur les graphes planaires ou leurs sous-classes, ayant pour but de minimiser le nombre de couleurs nécessaires pour un degré maximum ou un degré moyen maximum (Mad) donnés. Cette thèse traite également de décompositions induites de graphes, et démontre qu'il existe pour tout graphe $H$ une suite infinie de graphes denses dont les arêtes peuvent être partitionnées en copies induites de $H$. Cette preuve requiert le formalisme des hypergraphes, pour lesquels un autre résultat de décomposition est démontré, i.e. une décomposition optimale de l'hypergraphe complet 3-régulier en hypergraphes $\alpha$-acycliques. La troisième parti porte sur des questions algorithmiques. Elles consistent en problèmes d'optimisation ou d'existence, motivés par le routage d'information dans les réseaux, analysés par le formalisme classique de complexité algorithmique, ou traitent de la recherche de sous-graphes dans le formalisme de la complexité paramétrée. Dans une quatrième partie sont considérés des problèmes de comptage issus de la chimie, suivis de la présentation de Programmes Linéaires Entiers utilisés dans le logiciel de mathématiques Sage.

APA, Harvard, Vancouver, ISO, and other styles

10

Kim, Pilho. "E-model event-based graph data model theory and implementation /." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/29608.

Full text

Abstract:

Thesis (Ph.D)--Electrical and Computer Engineering, Georgia Institute of Technology, 2010.
Committee Chair: Madisetti, Vijay; Committee Member: Jayant, Nikil; Committee Member: Lee, Chin-Hui; Committee Member: Ramachandran, Umakishore; Committee Member: Yalamanchili, Sudhakar. Part of the SMARTech Electronic Thesis and Dissertation Collection.

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Application of graph theory"

1

Ehrig, Hartmut, Gregor Engels, Hans-Jörg Kreowski, and Grzegorz Rozenberg, eds. Theory and Application of Graph Transformations. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/b75045.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Foulds, L. R. Graph theory applications. New York: Springer-Verlag, 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Foulds, L. R. Graph theory applications. Hamilton, N.Z: University of Waikato, School of Management Studies, 1988.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Foulds, L. R. Graph theory applications. 2nd ed. New York: Springer-Verlag, 1994.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Graph theory applications. New York: Springer-Verlag, 1992.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Foulds, L. R. Graph Theory Applications. New York, NY: Springer New York, 1992. http://dx.doi.org/10.1007/978-1-4612-0933-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Vasudev, C. Graph theory with applications. New Delhi: New Age International (P) Ltd., Publishers, 2006.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Jay, Yellen, ed. Graph theory and its applications. Boca Raton, Fla: CRC Press, 1999.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

R, Balakrishnan, Sethuraman G, and Wilson Robin J, eds. Graph theory and its applications. New Delhi: Narosa Pub. House, 2004.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Jay, Yellen, ed. Graph theory and its applications. 2nd ed. Boca Raton: Chapman & Hall/CRC, 2006.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Application of graph theory"

1

Beeler, Robert A. "Application: Graph Theory." In How to Count, 309–43. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-13844-2_11.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Vernadat, François, Pierre Azéma, and François Michel. "Covering step graph." In Application and Theory of Petri Nets 1996, 516–35. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61363-3_28.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Rahman, Md Saidur. "Graphs and Their Applications." In Basic Graph Theory, 1–9. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-49475-3_1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Purchase, Helen C., David Carrington, and Jo-Anne Allder. "Experimenting with Aesthetics-Based Graph Layout." In Theory and Application of Diagrams, 498–501. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-44590-0_46.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Schuster, Stefan. "Knowledge Representation and Graph Transformation." In Theory and Application of Graph Transformations, 228–37. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/978-3-540-46464-8_16.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Feeney, Aidan, Ala K. W. Hola, Simon P. Liversedge, John M. Findlay, and Robert Metcalf. "How People Extract Information from Graphs: Evidence from a Sentence-Graph Verification Paradigm." In Theory and Application of Diagrams, 149–61. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-44590-0_16.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Jeribi, Aref. "Spectral Graph Theory." In Spectral Theory and Applications of Linear Operators and Block Operator Matrices, 413–39. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-17566-9_12.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Schürr, Andy, and Andreas J. Winter. "UML Packages for PROgrammed Graph REwriting Systems." In Theory and Application of Graph Transformations, 396–409. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/978-3-540-46464-8_28.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Verlinden, Nico, and Dirk Janssens. "A Framework for NLC and ESM: Local Action Systems." In Theory and Application of Graph Transformations, 194–214. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/978-3-540-46464-8_14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Drewes, Frank. "Some Remarks on the Generative Power of Collage Grammars and Chain-Code Grammars." In Theory and Application of Graph Transformations, 1–14. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/978-3-540-46464-8_1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Application of graph theory"

1

Mekki, Ahmed, and Simon Collart-Dutilleul. "Graph theory: Application to system recovery." In 2012 UKACC International Conference on Control (CONTROL). IEEE, 2012. http://dx.doi.org/10.1109/control.2012.6334718.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Host-Madsen, Anders, and June Zhang. "Coding of Graphs with Application to Graph Anomaly Detection." In 2018 IEEE International Symposium on Information Theory (ISIT). IEEE, 2018. http://dx.doi.org/10.1109/isit.2018.8437551.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Bhattacharya, Supratim, and Jayanta Poray. "Application of graph theory in bigdata environment." In 2016 International Conference on Computer, Electrical & Communication Engineering (ICCECE). IEEE, 2016. http://dx.doi.org/10.1109/iccece.2016.8009585.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Chatzigeorgiou, Alexander, Nikolaos Tsantalis, and George Stephanides. "Application of graph theory to OO software engineering." In the 2006 international workshop. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1137661.1137669.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Basavaprasad, B., and Ravindra S. Hegadi. "Graph theory and its application to image segmentation." In 2017 International Conference on Energy, Communication, Data Analytics and Soft Computing (ICECDS). IEEE, 2017. http://dx.doi.org/10.1109/icecds.2017.8389737.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

ROBERTS, FRED. "SOME APPLICATIONS OF GRAPH THEORY." In Present and Future. WORLD SCIENTIFIC, 2001. http://dx.doi.org/10.1142/9789812799890_0008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Kusmayadi, Tri Atmojo, and Nugroho Arif Sudibyo. "The eccentric digraph of caterpillar graph and generalized Jahangir graph." In THE THIRD INTERNATIONAL CONFERENCE ON MATHEMATICS: Education, Theory and Application. AIP Publishing, 2021. http://dx.doi.org/10.1063/5.0040222.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Pratama, Javas Alfreda Belva Yoga, and Tri Atmojo Kusmayadi. "On the local metric dimension of dipyramidal graph and king graph." In THE THIRD INTERNATIONAL CONFERENCE ON MATHEMATICS: Education, Theory and Application. AIP Publishing, 2021. http://dx.doi.org/10.1063/5.0039319.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Leung, Tsun Fung, and Tsun Ho Leung. "An Investigation of Graph Theory Application on Portfolio Investment." In the 2019 10th International Conference. New York, New York, USA: ACM Press, 2019. http://dx.doi.org/10.1145/3345035.3345090.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Yang, Qiaoyan, and Qinghong Zeng. "Application of Genetic Algorithms in Graph Theory and Optimization." In 2016 3rd International Conference on Materials Engineering, Manufacturing Technology and Control. Paris, France: Atlantis Press, 2016. http://dx.doi.org/10.2991/icmemtc-16.2016.6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Application of graph theory"

1

Burch, Kimberly Jordan. Chemical Graph Theory. Washington, DC: The MAA Mathematical Sciences Digital Library, August 2008. http://dx.doi.org/10.4169/loci002857.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Thomas, Robin. Graph Minors: Structure Theory and Algorithms. Fort Belvoir, VA: Defense Technical Information Center, January 1993. http://dx.doi.org/10.21236/ada271851.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

GEORGIA INST OF TECH ATLANTA. Graph Minors: Structure Theory and Algorithms. Fort Belvoir, VA: Defense Technical Information Center, April 1993. http://dx.doi.org/10.21236/ada266033.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Obert, James, Sean D. Turner, and Jason Hamlet. Graph Theory and IC Component Design Analysis. Office of Scientific and Technical Information (OSTI), March 2020. http://dx.doi.org/10.2172/1606298.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Sweeney, Matthew, and Emily Shinkle. Understanding Discrete Fracture Networks Through Spectral Graph Theory. Office of Scientific and Technical Information (OSTI), August 2021. http://dx.doi.org/10.2172/1812641.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Sweeney, Matthew, and Emily Shinkle. Understanding Discrete Fracture Networks Through Spectral Graph Theory. Office of Scientific and Technical Information (OSTI), August 2021. http://dx.doi.org/10.2172/1812622.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Mittrick, Mark R. Smartphone Application Enabling Global Graph Exploitation and Research. Fort Belvoir, VA: Defense Technical Information Center, May 2013. http://dx.doi.org/10.21236/ada590072.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Horan, Victoria, and Michael Gudaitis. Investigation of Zero Knowledge Proof Approaches Based on Graph Theory. Fort Belvoir, VA: Defense Technical Information Center, February 2011. http://dx.doi.org/10.21236/ada540835.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Carlson, J. L., R. A. Haffenden, G. W. Bassett, W. A. Buehring, M. J. ,. III Collins, S. M. Folga, F. D. Petit, J. A. Phillips, D. R. Verner, and R. G. Whitfield. Resilience: Theory and Application. Office of Scientific and Technical Information (OSTI), February 2012. http://dx.doi.org/10.2172/1044521.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Martin, S. P. The graph representation approach to topological field theory in 2 + 1 dimensions. Office of Scientific and Technical Information (OSTI), February 1991. http://dx.doi.org/10.2172/5812219.

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!