Log in

Relevant bibliographies by topics / Graph theory applications

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Graph theory applications'

Author: Grafiati

Published: 24 April 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 'Graph theory applications.'

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 "Graph theory applications"

1

Lloyd, E. Keith, and L. R. Foulds. "Graph Theory Applications." Mathematical Gazette 78, no. 481 (March 1994): 95. http://dx.doi.org/10.2307/3619469.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

MACKIE, IAN, and DETLEF PLUMP. "Theory and applications of term graph rewriting: introduction." Mathematical Structures in Computer Science 17, no. 3 (June 2007): 361–62. http://dx.doi.org/10.1017/s0960129507006081.

Full text

Abstract:

Term graph rewriting is concerned with the representation of functional expressions as graphs and the evaluation of these expressions by rule-based graph transformation. The advantage of computing with graphs rather than terms is that common subexpressions can be shared, improving the efficiency of computations in space and time. Sharing is ubiquitous in implementations of programming languages: many functional, logic, object-oriented and concurrent calculi are implemented using term graphs.

APA, Harvard, Vancouver, ISO, and other styles

3

Pirzada, S. "Applications of graph theory." PAMM 7, no. 1 (December 2007): 2070013. http://dx.doi.org/10.1002/pamm.200700981.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

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

5

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

6

Anderson, Ian, and H. Walther. "Ten Applications of Graph Theory." Mathematical Gazette 70, no. 453 (October 1986): 245. http://dx.doi.org/10.2307/3615713.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Abbott, Steve, Jonathan Gross, and Jay Yellen. "Graph Theory and Its Applications." Mathematical Gazette 84, no. 499 (March 2000): 182. http://dx.doi.org/10.2307/3621555.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Dias, Jerry Ray, and George W. A. Milne. "Chemical Applications of Graph Theory." Journal of Chemical Information and Modeling 32, no. 1 (January 1, 1992): 1. http://dx.doi.org/10.1021/ci00005a600.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Formanowicz, Piotr, and Krzysztof Tanaś. "A survey of graph coloring - its types, methods and applications." Foundations of Computing and Decision Sciences 37, no. 3 (October 1, 2012): 223–38. http://dx.doi.org/10.2478/v10209-011-0012-y.

Full text

Abstract:

Abstract Graph coloring is one of the best known, popular and extensively researched subject in the field of graph theory, having many applications and conjectures, which are still open and studied by various mathematicians and computer scientists along the world. In this paper we present a survey of graph coloring as an important subfield of graph theory, describing various methods of the coloring, and a list of problems and conjectures associated with them. Lastly, we turn our attention to cubic graphs, a class of graphs, which has been found to be very interesting to study and color. A brief review of graph coloring methods (in Polish) was given by Kubale in [32] and a more detailed one in a book by the same author. We extend this review and explore the field of graph coloring further, describing various results obtained by other authors and show some interesting applications of this field of graph theory.

APA, Harvard, Vancouver, ISO, and other styles

10

Huang, Liangsong, Yu Hu, Yuxia Li, P. K. Kishore Kumar, Dipak Koley, and Arindam Dey. "A Study of Regular and Irregular Neutrosophic Graphs with Real Life Applications." Mathematics 7, no. 6 (June 17, 2019): 551. http://dx.doi.org/10.3390/math7060551.

Full text

Abstract:

Fuzzy graph theory is a useful and well-known tool to model and solve many real-life optimization problems. Since real-life problems are often uncertain due to inconsistent and indeterminate information, it is very hard for an expert to model those problems using a fuzzy graph. A neutrosophic graph can deal with the uncertainty associated with the inconsistent and indeterminate information of any real-world problem, where fuzzy graphs may fail to reveal satisfactory results. The concepts of the regularity and degree of a node play a significant role in both the theory and application of graph theory in the neutrosophic environment. In this work, we describe the utility of the regular neutrosophic graph and bipartite neutrosophic graph to model an assignment problem, a road transport network, and a social network. For this purpose, we introduce the definitions of the regular neutrosophic graph, star neutrosophic graph, regular complete neutrosophic graph, complete bipartite neutrosophic graph, and regular strong neutrosophic graph. We define the d m - and t d m -degrees of a node in a regular neutrosophic graph. Depending on the degree of the node, this paper classifies the regularity of a neutrosophic graph into three types, namely d m -regular, t d m -regular, and m-highly irregular neutrosophic graphs. We present some theorems and properties of those regular neutrosophic graphs. The concept of an m-highly irregular neutrosophic graph on cycle and path graphs is also investigated in this paper. The definition of busy and free nodes in a regular neutrosophic graph is presented here. We introduce the idea of the μ -complement and h-morphism of a regular neutrosophic graph. Some properties of complement and isomorphic regular neutrosophic graphs are presented here.

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Graph theory applications"

1

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

2

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

3

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

4

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

5

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

6

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

7

Shiping, Liu. "Synthetic notions of curvature and applications in graph theory." Doctoral thesis, Universitätsbibliothek Leipzig, 2013. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-102197.

Full text

Abstract:

The interaction between the study of geometric and analytic aspects of Riemannian manifolds and that of graphs is a very amazing subject. The study of synthetic curvature notions on graphs adds new contributions to this topic. In this thesis, we mainly study two kinds of synthetic curvature notions: the Ollivier-Ricci cuvature on locally finite graphs and the combinatorial curvature on infinite semiplanar graphs. In the first part, we study the Ollivier-Ricci curvature. As known in Riemannian geometry, a lower Ricci curvature bound prevents geodesics from diverging too fast on average. We translate this Riemannian idea into a combinatorial setting using the Olliver-Ricci curvature notion. Note that on a graph, the analogue of geodesics starting in different directions, but eventually approaching each other again, would be a triangle. We derive lower and upper Ollivier-Ricci curvature bounds on graphs in terms of number of triangles, which is sharp for instance for complete graphs. We then describe the relation between Ollivier-Ricci curvature and the local clustering coefficient, which is an important concept in network analysis introduced by Watts-Strogatz. Furthermore, positive lower boundedness of Ollivier-Ricci curvature for neighboring vertices imply the existence of at least one triangle. It turns out that the existence of triangles can also improve Lin-Yau\'s curvature dimension inequality on graphs and then produce an implication from Ollivier-Ricci curvature lower boundedness to the curvature dimension inequality. The existence of triangles prevents a graph from being bipartite. A finite graph is bipartite if and only if its largest eigenvalue equals 2. Therefore it is natural that Ollivier-Ricci curvature is closely related to the largest eigenvalue estimates. We combine Ollivier-Ricci curvature notion with the neighborhood graph method developed by Bauer-Jost to study the spectrum estimates of a finite graph. We can always obtain nontrivial estimates on a non-bipartite graph even if its curvature is nonpositive. This answers one of Ollivier\'s open problem in the finite graph setting. In the second part of this thesis, we study systematically infinite semiplanar graphs with nonnegative combinatorial curvature. Unlike the previous Gauss-Bonnet formula approach, we explore an Alexandrov approach based on the observation that the nonnegative combinatorial curvature on a semiplanar graph is equivalent to nonnegative Alexandrov curvature on the surface obtained by replacing each face by a regular polygon of side length one with the same facial degree and gluing the polygons along common edges. Applying Cheeger-Gromoll splitting theorem on the surface, we give a metric classification of infinite semiplanar graphs with nonnegative curvature. We also construct the graphs embedded into the projective plane minus one point. Those constructions answer a question proposed by Chen. We further prove the volume doubling property and Poincare inequality which make the running of Nash-Moser iteration possible. We in particular explore the volume growth behavior on Archimedean tilings on a plane and prove that they satisfy a weak version of relative volume comparison with constant 1. With the above two basic inequalities in hand, we study the geometric function theory of infinite semiplanar graphs with nonnegative curvature. We obtain the Liouville type theorem for positive harmonic functions, the parabolicity. We also prove a dimension estimate for polynomial growth harmonic functions, which is an extension of the solution of Colding-Minicozzi of a conjecture of Yau in Riemannian geometry.

APA, Harvard, Vancouver, ISO, and other styles

8

Sutinuntopas, Somporn. "Applications of Graph Theory and Topology to Combinatorial Designs." Thesis, University of North Texas, 1988. https://digital.library.unt.edu/ark:/67531/metadc331968/.

Full text

Abstract:

This dissertation is concerned with the existence and the isomorphism of designs. The first part studies the existence of designs. Chapter I shows how to obtain a design from a difference family. Chapters II to IV study the existence of an affine 3-(p^m,4,λ) design where the v-set is the Galois field GF(p^m). Associated to each prime p, this paper constructs a graph. If the graph has a 1-factor, then a difference family and hence an affine design exists. The question arises of how to determine when the graph has a 1-factor. It is not hard to see that the graph is connected and of even order. Tutte's theorem shows that if the graph is 2-connected and regular of degree three, then the graph has a 1-factor. By using the concept of quadratic reciprocity, this paper shows that if p Ξ 53 or 77 (mod 120), the graph is almost regular of degree three, i.e., every vertex has degree three, except two vertices each have degree tow. Adding an extra edge joining the two vertices with degree tow gives a regular graph of degree three. Also, Tutte proved that if A is an edge of the graph satisfying the above conditions, then it must have a 1-factor which contains A. The second part of the dissertation is concerned with determining if two designs are isomorphic. Here the v-set is any group G and translation by any element in G gives a design automorphism. Given a design B and its difference family D, two topological spaces, B and D, are constructed. We give topological conditions which imply that a design isomorphism is a group isomorphism.

APA, Harvard, Vancouver, ISO, and other styles

9

Marchand-Maillet, Stephane. "Graph theory and discrete geometry for digital image analysis : theory and applications." Thesis, Imperial College London, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.267485.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Chen, Zhiqian. "Graph Neural Networks: Techniques and Applications." Diss., Virginia Tech, 2020. http://hdl.handle.net/10919/99848.

Full text

Abstract:

Effective information analysis generally boils down to the geometry of the data represented by a graph. Typical applications include social networks, transportation networks, the spread of epidemic disease, brain's neuronal networks, gene data on biological regulatory networks, telecommunication networks, knowledge graph, which are lying on the non-Euclidean graph domain. To describe the geometric structures, graph matrices such as adjacency matrix or graph Laplacian can be employed to reveal latent patterns. This thesis focuses on the theoretical analysis of graph neural networks and the development of methods for specific applications using graph representation. Four methods are proposed, including rational neural networks for jump graph signal estimation, RemezNet for robust attribute prediction in the graph, ICNet for integrated circuit security, and CNF-Net for dynamic circuit deobfuscation. For the first method, a recent important state-of-art method is the graph convolutional networks (GCN) nicely integrate local vertex features and graph topology in the spectral domain. However, current studies suffer from drawbacks: graph CNNs rely on Chebyshev polynomial approximation which results in oscillatory approximation at jump discontinuities since Chebyshev polynomials require degree $Omega$(poly(1/$epsilon$)) to approximate a jump signal such as $|x|$. To reduce complexity, RatioanlNet is proposed to integrate rational function and neural networks for graph node level embeddings. For the second method, we propose a method for function approximation which suffers from several drawbacks: non-robustness and infeasibility issue; neural networks are incapable of extracting analytical representation; there is no study reported to integrate the superiorities of neural network and Remez. This work proposes a novel neural network model to address the above issues. Specifically, our method utilizes the characterizations of Remez to design objective functions. To avoid the infeasibility issue and deal with the non-robustness, a set of constraints are imposed inspired by the equioscillation theorem of best rational approximation. The third method proposes an approach for circuit security. Circuit obfuscation is a recently proposed defense mechanism to protect digital integrated circuits (ICs) from reverse engineering. Estimating the deobfuscation runtime is a challenging task due to the complexity and heterogeneity of graph-structured circuit, and the unknown and sophisticated mechanisms of the attackers for deobfuscation. To address the above-mentioned challenges, this work proposes the first graph-based approach that predicts the deobfuscation runtime based on graph neural networks. The fourth method proposes a representation for dynamic size of circuit graph. By analyzing SAT attack method, a conjunctive normal form (CNF) bipartite graph is utilized to characterize the complexity of this SAT problem. To overcome the difficulty in capturing the dynamic size of the CNF graph, an energy-based kernel is proposed to aggregate dynamic features.
Doctor of Philosophy
Graph data is pervasive throughout most fields, including pandemic spread network, social network, transportation roads, internet, and chemical structure. Therefore, the applications modeled by graph benefit people's everyday life, and graph mining derives insightful opinions from this complex topology. This paper investigates an emerging technique called graph neural newton (GNNs), which is designed for graph data mining. There are two primary goals of this thesis paper: (1) understanding the GNNs in theory, and (2) apply GNNs for unexplored and values real-world scenarios. For the first goal, we investigate spectral theory and approximation theory, and a unified framework is proposed to summarize most GNNs. This direction provides a possibility that existing or newly proposed works can be compared, and the actual process can be measured. Specifically, this result demonstrates that most GNNs are either an approximation for a function of graph adjacency matrix or a function of eigenvalues. Different types of approximations are analyzed in terms of physical meaning, and the advantages and disadvantages are offered. Beyond that, we proposed a new optimization for a highly accurate but low efficient approximation. Evaluation of synthetic data proves its theoretical power, and the tests on two transportation networks show its potentials in real-world graphs. For the second goal, the circuit is selected as a novel application since it is crucial, but there are few works. Specifically, we focus on a security problem, a high-value real-world problem in industry companies such as Nvidia, Apple, AMD, etc. This problem is defined as a circuit graph as apply GNN to learn the representation regarding the prediction target such as attach runtime. Experiment on several benchmark circuits shows its superiority on effectiveness and efficacy compared with competitive baselines. This paper provides exploration in theory and application with GNNs, which shows a promising direction for graph mining tasks. Its potentials also provide a wide range of innovations in graph-based problems.

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Graph theory applications"

1

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

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

3

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

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

6

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

7

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

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

9

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

10

Cvetković, Dragoš M. Applications of graph spectra. Edited by Gutman Ivan 1947-. Beograd: Matematički institut SANU, 2009.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Graph theory applications"

1

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

2

Balakrishnan, R., and K. Ranganathan. "Applications." In A Textbook of Graph Theory, 199–211. New York, NY: Springer New York, 2000. http://dx.doi.org/10.1007/978-1-4419-8505-7_10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

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

4

Thorup, Mikkel, and David R. Karger. "Dynamic Graph Algorithms with Applications." In Algorithm Theory - SWAT 2000, 1–9. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-44985-x_1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Murasugi, Kunio. "Graph Theory Applied to Chemistry." In Knot Theory & Its Applications, 284–99. Boston, MA: Birkhäuser Boston, 2008. http://dx.doi.org/10.1007/978-0-8176-4719-3_15.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

McGregor, Andrew. "Graph Sketching and Streaming: New Approaches for Analyzing Massive Graphs." In Computer Science – Theory and Applications, 20–24. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-58747-9_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Poloni, Federico. "Permuted Graph Matrices and Their Applications." In Numerical Algebra, Matrix Theory, Differential-Algebraic Equations and Control Theory, 107–29. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-15260-8_5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Schoonenberg, Wester C. H., Inas S. Khayal, and Amro M. Farid. "Applications of Hetero-functional Graph Theory." In A Hetero-functional Graph Theory for Modeling Interdependent Smart City Infrastructure, 163–70. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-99301-0_6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Cotta, Carlos, and José M. Troya. "Analyzing Directed Acyclic Graph Recombination." In Computational Intelligence. Theory and Applications, 739–48. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45493-4_72.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Golovach, Petr A., Bernard Lidický, Barnaby Martin, and Daniël Paulusma. "Finding Vertex-Surjective Graph Homomorphisms." In Computer Science – Theory and Applications, 160–71. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-30642-6_16.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Graph theory applications"

1

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

2

Spielman, Daniel A. "Spectral Graph Theory and its Applications." In 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07). IEEE, 2007. http://dx.doi.org/10.1109/focs.2007.56.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Spielman, Daniel A. "Spectral Graph Theory and its Applications." In 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07). IEEE, 2007. http://dx.doi.org/10.1109/focs.2007.4389477.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Da Lozzo, Giordano, Marco Di Bartolomeo, Maurizio Patrignani, Giuseppe Di Battista, Davide Cannone, and Sergio Tortora. "Drawing Georeferenced Graphs - Combining Graph Drawing and Geographic Data." In International Conference on Information Visualization Theory and Applications. SCITEPRESS - Science and and Technology Publications, 2015. http://dx.doi.org/10.5220/0005266601090116.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Riaz, Ferozuddin, and Khidir M. Ali. "Applications of Graph Theory in Computer Science." In 2011 3rd International Conference on Computational Intelligence, Communication Systems and Networks (CICSyN 2011). IEEE, 2011. http://dx.doi.org/10.1109/cicsyn.2011.40.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Dawood, Harith A. "Graph Theory and Cyber Security." In 2014 3rd International Conference on Advanced Computer Science Applications and Technologies (ACSAT). IEEE, 2014. http://dx.doi.org/10.1109/acsat.2014.23.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

"SPLITTING THE SCENE GRAPH - Using Spatial Relationship Graphs Instead of Scene Graphs in Augmented Reality." In International Conference on Computer Graphics Theory and Applications. SciTePress - Science and and Technology Publications, 2008. http://dx.doi.org/10.5220/0001099804560459.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Sarkar, Amites, and Martin Haenggi. "Percolation in the secrecy graph." In 2011 Information Theory and Applications Workshop (ITA). IEEE, 2011. http://dx.doi.org/10.1109/ita.2011.5743576.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Sun, Feng, Xiao-Bing Qu, Tian-Fei Wang, and Xue-Ping Wang. "Applications of realizable Boolean matrices in graph theory." In 2013 Joint IFSA World Congress and NAFIPS Annual Meeting (IFSA/NAFIPS). IEEE, 2013. http://dx.doi.org/10.1109/ifsa-nafips.2013.6608510.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Chalfant, Julie, Chrys Chryssostomidis, Daniel Snyder, Mark A. Parsons, and Alan Brown. "Graph theory applications in FOCUS-compliant ship designs." In 2017 IEEE Electric Ship Technologies Symposium (ESTS). IEEE, 2017. http://dx.doi.org/10.1109/ests.2017.8069324.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Graph theory applications"

1

Lichter, Amnon, David Obenland, Nirit Bernstein, Jennifer Hashim, and Joseph Smilanick. The role of potassium in quality of grapes after harvest. United States Department of Agriculture, October 2015. http://dx.doi.org/10.32747/2015.7597914.bard.

Full text

Abstract:

Objectives: The objectives of the proposal were to study how potassium (K) enters the berry and in what tissues it accumulates, to determine what is the sensitive phenological stage that is responsive to K, to study the influence of K on sugar translocation, to determine if K has effects on expression of genes in source and sink organs and to study applied aspects of the responses to K at the vineyard level. During the research it was realized that K acts externally so a major part of the original objectives had to be deserted and new ones, i.e. the role of K in enhancing water loss from the berry, had to be developed. In addition, the US partners developed practical objectives of understanding the interaction of K application and water deficit as well as application of growth regulators. Background: In our preliminary data we showed that application of K at mid-ripening enhanced sugar accumulation of table grapes. This finding is of major implications to both early and late harvested grapes and it was essential to understand the mode of action of this treatment. Our major hypothesis was that K enters the berry and by that increases sugar translocation into the berry. In addition it was important to cover practical issues of the application which may influence its efficacy and its reproducibility. Conclusions: The major conclusion from the research was that our initial hypothesis was wrong. Mineral analysis of pulp tissue indicated that upon application of K there was a significant increase in most of the major minerals. Subsequently, we developed a new hypothesis that K acts by increasing the water loss from the berry. In vitro studies of K-treated berries corroborated this hypothesis showing greater weight-loss of treated berries. This was not necessarily expressed in the vineyard as in some experiments berry weight remained unchanged, suggesting that the vine compensated for the enhanced water loss. Importantly, we also discovered that the efficacy of different K salts was strongly correlated to the pH of the salt solution: basic K salts had better efficacy than neutral or acidic salts and modifying the pH of the same salt changed its efficacy. It was therefore suggested that K changes the properties of the cuticle making it more susceptible to water loss. Of the practical aspects it was found that application of K to the clusters was sufficient to trigger its affect and that dual application of K had a stronger effect than single application. With regard to timing, it was realized that application of K after veraison was affective and the berries responded also when ripe. While the effect of K application was significant at harvest, it was mostly insignificant one week after application, suggesting that prolonged exposure to K was required. Implications: The scientific implications of the study are that the external mineral composition of the berry may have a significant role in sugar accumulation and that water loss may have an important role in sugar accumulation in grapes. It is not entirely clear how K modulates the cuticle but according to the literature its incorporation into the cuticle may increase its polarity and facilitate generation of "water bridges" between the flesh and the environment. The practical implications of this study are very significant because realizing the mode of action of K can facilitate a much more efficient application strategy. For example, it can be understood that sprays must be directed to the clusters rather than the whole vines and it can be predicted that the length of exposure is important. Also, by increasing the pH of simple K salts, the efficacy of the treatment can be enhanced, saving in the costs of the treatment. Finally, the ability of grape growers to apply K in a safe and knowledgeable way can have significant impact on the length of the season of early grape cultivars and improve the flavor of high grape yields which may otherwise have compromised sugar levels.

APA, Harvard, Vancouver, ISO, and other styles

2

Or, Etti, Tai-Ping Sun, Amnon Lichter, and Avichai Perl. Characterization and Manipulation of the Primary Components in Gibberellin Signaling in the Grape Berry. United States Department of Agriculture, January 2010. http://dx.doi.org/10.32747/2010.7592649.bard.

Full text

Abstract:

Seedless cultivars dominate the table grape industry. In these cultivars it is mandatory to apply gibberellin (GA) to stimulate berry development to a commercially acceptable size. These cultivars differ in their sensitivity to GA application, and it frequently results in adverse effects such as decreased bud fertility and increased fruit drop. Our long term goals are to (1) understand the molecular basis for the differential sensitivity and identify markers for selection of sensitive cultivars (2) to develop new strategies for targeted manipulation of the grape berry response to GA that will eliminate the need in GA application and the undesirable effects of GA on the vine, while maintaining its desirable effects on the berry. Both strategies are expected to reduce production cost and meet growing consumer demand for reduced use of chemicals. This approach relies on a comprehensive characterization of the central components in the GA signaling cascade in the berry. Several key components in the GA signaling pathway were identified in Arabidopsis and rice, including the GA receptors, GID1s, and a family of DELLA proteins that are the major negative regulators of the GA response. GA activates its response pathway by binding to GID1s, which then target DELLAs for degradation via interaction with SLY, a DELLA specific F-box protein. In grape, only one DELLA gene was characterized prior to this study, which plays a major role in inhibiting GA-promoted stem growth and GA-repressed floral induction but it does not regulate fruit growth. Therefore, we speculated that other DELLA family member(s) may control GA responses in berry, and their identification and manipulation may result in GA-independent berry growth. In the current study we isolated two additional VvDELLA family members, two VvGID1 genes and two VvSLY genes. Arabidopsis anti-AtRGA polyclonal antibodies recognized all three purified VvDELLA proteins, but its interaction with VvDELLA3 was weaker. Overexpression of the VvDELLAs, the VvGID1s, and the VvSLYs in the Arabidopsis mutants ga1-3/rga-24, gid1a-2/1c-2 and sly1-10, respectively, rescued the various mutant phenotypes. In vitro GAdependent physical interaction was shown between the VvDELLAs and the VvGID1s, and GAindependent interaction was shown between the VvDELLAs and VvSLYs. Interestingly, VvDELLA3 did not interact with VvGID1b. Together, the results indicate that the identified grape homologs serve as functional DELLA repressors, receptors and DELLA-interacting F-box proteins. Expression analyses revealed that (1) VvDELLA2 was expressed in all the analyzed tissues and was the most abundant (2) VvDELLA1 was low expressed in berries, confirming former study (3) Except in carpels and very young berries, VvDELLA3 levels were the lowest in most tissues. (4) Expression of both VvGID1s was detected in all the grape tissues, but VvGID1b transcript levels were significantly higher than VvGID1a. (5) In general, both VvDELLAs and VvGID1s transcripts levels increased as tissues aged. Unfertilized and recently fertilized carpels did not follow this trend, suggesting different regulatory mechanism of GA signaling in these stages. Characterization of the response to GA of various organs in three seedless cultivars revealed differential response of the berries and rachis. Interestingly, VvDELLA3 transcript levels in the GA-unresponsive berries of cv. Spring blush were significantly higher compared to their levels in the highly responsive berries of cv. Black finger. Assuming that VvDELLA2 and VvDELLA3 are regulating berry size, constructs carrying potential dominant mutations in each gene were created. Furthermore, constitutive silencing of these genes by mIR is underway, to reveal the effect of each gene on the berry phenotype.

APA, Harvard, Vancouver, ISO, and other styles

3

Or, Etti, David Galbraith, and Anne Fennell. Exploring mechanisms involved in grape bud dormancy: Large-scale analysis of expression reprogramming following controlled dormancy induction and dormancy release. United States Department of Agriculture, December 2002. http://dx.doi.org/10.32747/2002.7587232.bard.

Full text

Abstract:

The timing of dormancy induction and release is very important to the economic production of table grape. Advances in manipulation of dormancy induction and dormancy release are dependent on the establishment of a comprehensive understanding of biological mechanisms involved in bud dormancy. To gain insight into these mechanisms we initiated the research that had two main objectives: A. Analyzing the expression profiles of large subsets of genes, following controlled dormancy induction and dormancy release, and assessing the role of known metabolic pathways, known regulatory genes and novel sequences involved in these processes B. Comparing expression profiles following the perception of various artificial as well as natural signals known to induce dormancy release, and searching for gene showing similar expression patterns, as candidates for further study of pathways having potential to play a central role in dormancy release. We first created targeted EST collections from V. vinifera and V. riparia mature buds. Clones were randomly selected from cDNA libraries prepared following controlled dormancy release and controlled dormancy induction and from respective controls. The entire collection (7920 vinifera and 1194 riparia clones) was sequenced and subjected to bioinformatics analysis, including clustering, annotations and GO classifications. PCR products from the entire collection were used for printing of cDNA microarrays. Bud tissue in general, and the dormant bud in particular, are under-represented within the grape EST database. Accordingly, 59% of the our vinifera EST collection, composed of 5516 unigenes, are not included within the current Vitis TIGR collection and about 22% of these transcripts bear no resemblance to any known plant transcript, corroborating the current need for our targeted EST collection and the bud specific cDNA array. Analysis of the V. riparia sequences yielded 814 unigenes, of which 140 are unique (keilin et al., manuscript, Appendix B). Results from computational expression profiling of the vinifera collection suggest that oxidative stress, calcium signaling, intracellular vesicle trafficking and anaerobic mode of carbohydrate metabolism play a role in the regulation and execution of grape-bud dormancy release. A comprehensive analysis confirmed the induction of transcription from several calcium–signaling related genes following HC treatment, and detected an inhibiting effect of calcium channel blocker and calcium chelator on HC-induced and chilling-induced bud break. It also detected the existence of HC-induced and calcium dependent protein phosphorylation activity. These data suggest, for the first time, that calcium signaling is involved in the mechanism of dormancy release (Pang et al., in preparation). We compared the effects of heat shock (HS) to those detected in buds following HC application and found that HS lead to earlier and higher bud break. We also demonstrated similar temporary reduction in catalase expression and temporary induction of ascorbate peroxidase, glutathione reductase, thioredoxin and glutathione S transferase expression following both treatments. These findings further support the assumption that temporary oxidative stress is part of the mechanism leading to bud break. The temporary induction of sucrose syntase, pyruvate decarboxylase and alcohol dehydrogenase indicate that temporary respiratory stress is developed and suggest that mitochondrial function may be of central importance for that mechanism. These finding, suggesting triggering of identical mechanisms by HS and HC, justified the comparison of expression profiles of HC and HS treated buds, as a tool for the identification of pathways with a central role in dormancy release (Halaly et al., in preparation). RNA samples from buds treated with HS, HC and water were hybridized with the cDNA arrays in an interconnected loop design. Differentially expressed genes from the were selected using R-language package from Bioconductor project called LIMMA and clones showing a significant change following both HS and HC treatments, compared to control, were selected for further analysis. A total of 1541 clones show significant induction, of which 37% have no hit or unknown function and the rest represent 661 genes with identified function. Similarly, out of 1452 clones showing significant reduction, only 53% of the clones have identified function and they represent 573 genes. The 661 induced genes are involved in 445 different molecular functions. About 90% of those functions were classified to 20 categories based on careful survey of the literature. Among other things, it appears that carbohydrate metabolism and mitochondrial function may be of central importance in the mechanism of dormancy release and studies in this direction are ongoing. Analysis of the reduced function is ongoing (Appendix A). A second set of hybridizations was carried out with RNA samples from buds exposed to short photoperiod, leading to induction of bud dormancy, and long photoperiod treatment, as control. Analysis indicated that 42 genes were significant difference between LD and SD and 11 of these were unique.

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!