Relevant bibliographies by topics / Graphs theory

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Graphs theory'

Author: Grafiati
Published: 4 June 2021
Last updated: 16 June 2025

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 'Graphs 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 "Graphs theory"

1

M, Jerlin Seles, and Dr U. Mary. "Strategy on Disaster Recovery Management based on Graph Theory Concepts." International Journal of Recent Technology and Engineering (IJRTE) 10, no. 4 (2021): 31–34. http://dx.doi.org/10.35940/ijrte.d6535.1110421.

Full text
Abstract:
The COVID-19 pandemic has asserted major baseline facts from disaster anthropology during the last three decades. Resilience could be based on the solution to the question: "What is the maximum amount of destruction, if any, that the graph (a network) can sustain while ensuring that at least one of each technology type remains and that the remaining induced subgraph is properly colored?" The concept of a graph's Chromatic Core Subgraph is a solution to the stated problem. In this paper, the pandemic graphs and certain sequential graphs are developed. For these graphs, the Chromatic core subgraph is obtained. The results of the pandemic graphs' Chromatic core subgraph are used to develop a disaster recovery strategy for the COVID-19 pandemic.
APA, Harvard, Vancouver, ISO, and other styles
2

Nada A Laabi. "Subring in Graph Theory." Advances in Nonlinear Variational Inequalities 27, no. 4 (2024): 284–87. http://dx.doi.org/10.52783/anvi.v27.1526.

Full text
Abstract:
In our study, we delved into the intricacies of graph theory by exploring the properties of subrings within various types of graphs. By focusing on prime graphs and simple graphs, we unraveled the complex relationship between subring-prime graphs. Additionally, we delved into the concept of homomorphism within both simple subring graphs and prime subring graphs, adding depth to our analysis.
APA, Harvard, Vancouver, ISO, and other styles
3

Prajapati, Rajeshri, Amit Parikh, and Pradeep Jha. "Exploring Novel Edge Connectivity in Graph Theory and its Impact on Eulerian Line Graphs." International Journal of Science and Research (IJSR) 12, no. 11 (2023): 1515–19. http://dx.doi.org/10.21275/sr231120155230.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Fujita, Takaaki, and Florentin Smarandache. "Antipodal Turiyam Neutrosophic Graphs." Neutrosophic Optimization and Intelligent Systems 5 (November 17, 2024): 1–13. http://dx.doi.org/10.61356/j.nois.2025.5422.

Full text
Abstract:
Graph theory, a mathematical field, investigates the relationships between entities through vertices and edges [29]. Within this discipline, Uncertain Graph Theory emerges to model uncertainties in realworld networks. This paper presents the concept of the Antipodal Turiyam Neutrosophic Graph. In an Antipodal Graph, two nodes are connected if their shortest path distance equals the graph's diameter, emphasizing connections between the farthest nodes. Turiyam Neutrosophic Graphs extend traditional graphs by introducing four membership values-truth, indeterminacy, falsity, and liberal state-assigned to each vertex and edge, enabling a more nuanced representation of complex relationships.
APA, Harvard, Vancouver, ISO, and other styles
5

Vidyashree H. R. "Some Derived Graphs of Ananta-Graphs." Panamerican Mathematical Journal 35, no. 3s (2025): 522–27. https://doi.org/10.52783/pmj.v35.i3s.4246.

Full text
Abstract:
Graph theory provides powerful tools for analyzing mathematical structures and sequences. The Ananta-graph, derived from the Collatz conjecture, represents integer transformations through directed edges, capturing number relationships under n→3n+1 and n→n/2 operations. This paper explores several derived graphs from the Ananta-graph, including line, middle, Mycielskian, subdivision, total, core, power, splitting and kernel graph, analyzing their structural properties and mathematical significance. By analyzing these derived graphs, we provide deeper insights into the topological, algebraic and computational properties of the Ananta-graph, contributing to both graph theory and number theory applications. This research further provides new perspectives on integer sequences and transformation-based graph models.
APA, Harvard, Vancouver, ISO, and other styles
6

Bywaters, Timothy, and Stephan Tornier. "Willis theory via graphs." Groups, Geometry, and Dynamics 13, no. 4 (2019): 1335–72. http://dx.doi.org/10.4171/ggd/525.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Sikora, Adam, and Bruce Westbury. "Confluence theory for graphs." Algebraic & Geometric Topology 7, no. 1 (2007): 439–78. http://dx.doi.org/10.2140/agt.2007.7.439.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Texier, Christophe, and Gilles Montambaux. "Scattering theory on graphs." Journal of Physics A: Mathematical and General 34, no. 47 (2001): 10307–26. http://dx.doi.org/10.1088/0305-4470/34/47/328.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Hatcher, Allen, and Karen Vogtmann. "Cerf Theory for Graphs." Journal of the London Mathematical Society 58, no. 3 (1998): 633–55. http://dx.doi.org/10.1112/s0024610798006644.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Babson, Eric, Hélène Barcelo, Mark de Longueville, and Reinhard Laubenbacher. "Homotopy theory of graphs." Journal of Algebraic Combinatorics 24, no. 1 (2006): 31–44. http://dx.doi.org/10.1007/s10801-006-9100-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Graphs theory"

1

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 theory, mainly in parametrized complexity.
APA, Harvard, Vancouver, ISO, and other styles
2

Myers, Joseph Samuel. "Extremal theory of graph minors and directed graphs." Thesis, University of Cambridge, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.619614.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Badaoui, Mohamad. "G-graphs and Expander graphs." Thesis, Normandie, 2018. http://www.theses.fr/2018NORMC207/document.

Full text
Abstract:
L’utilisation de l’algèbre pour résoudre des problèmes de graphes a conduit au développement de trois branches : théorie spectrale des graphes, géométrie et combinatoire des groupes et études des invariants de graphes. La notion de graphe d’expansions (invariant de graphes) est relativement récente, elle a été développée afin d’étudier la robustesse des réseaux de télécommunication. Il s’avère que la construction de familles infinies de graphes expanseurs est un problème difficile. Cette thèse traite principalement de la construction de nouvelles familles de tels graphes. Les graphes expanseurs possèdent des nombreuses applications en informatique, notamment dans la construction de certains algorithmes, en théorie de la complexité, sur les marches aléatoires (random walk), etc. En informatique théorique, ils sont utilisés pour construire des familles de codes correcteurs d’erreur. Comme nous l’avons déjà vu les familles d’expanseurs sont difficiles à construire. La plupart des constructions s'appuient sur des techniques algébriques complexes, principalement en utilisant des graphes de Cayley et des produit Zig-Zag. Dans cette thèse, nous présentons une nouvelle méthode de construction de familles infinies d’expanseurs en utilisant les G-graphes. Ceux-ci sont en quelque sorte une généralisation des graphes de Cayley. Plusieurs nouvelles familles infinies d’expanseurs sont construites, notamment la première famille d’expanseurs irréguliers<br>Applying algebraic and combinatorics techniques to solve graph problems leads to the birthof algebraic and combinatorial graph theory. This thesis deals mainly with a crossroads questbetween the two theories, that is, the problem of constructing infinite families of expandergraphs.From a combinatorial point of view, expander graphs are sparse graphs that have strongconnectivity properties. Expanders constructions have found extensive applications in bothpure and applied mathematics. Although expanders exist in great abundance, yet their explicitconstructions, which are very desirable for applications, are in general a hard task. Mostconstructions use deep algebraic and combinatorial approaches. Following the huge amountof research published in this direction, mainly through Cayley graphs and the Zig-Zagproduct, we choose to investigate this problem from a new perspective; namely by usingG-graphs theory and spectral hypergraph theory as well as some other techniques. G-graphsare like Cayley graphs defined from groups, but they correspond to an alternative construction.The reason that stands behind our choice is first a notable identifiable link between thesetwo classes of graphs that we prove. This relation is employed significantly to get many newresults. Another reason is the general form of G-graphs, that gives us the intuition that theymust have in many cases such as the relatively high connectivity property.The adopted methodology in this thesis leads to the identification of various approaches forconstructing an infinite family of expander graphs. The effectiveness of our techniques isillustrated by presenting new infinite expander families of Cayley and G-graphs on certaingroups. Also, since expanders stand in no single stem of graph theory, this brings us toinvestigate several closely related threads from a new angle. For instance, we obtain newresults concerning the computation of spectra of certain Cayley and G-graphs, and theconstruction of several new infinite classes of integral and Hamiltonian Cayley graphs
APA, Harvard, Vancouver, ISO, and other styles
4

Khouzam, Nelly. "A new class of brittle graphs /." Thesis, McGill University, 1986. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=66048.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Sen, Sagnik. "A contribution to the theory of graph homomorphisms and colorings." Phd thesis, Bordeaux, 2014. http://tel.archives-ouvertes.fr/tel-00960893.

Full text
Abstract:
Dans cette thèse, nous considérons des questions relatives aux homomorphismes de quatre types distincts de graphes : les graphes orientés, les graphes orientables, les graphes 2-arête colorés et les graphes signés. Pour chacun des ces quatre types, nous cherchons à déterminer le nombre chromatique, le nombre de clique relatif et le nombre de clique absolu pour différentes familles de graphes planaires : les graphes planaires extérieurs, les graphes planaires extérieurs de maille fixée, les graphes planaires et les graphes planaires de maille fixée. Nous étudions également les étiquetages "2-dipath" et "L(p,q)" des graphes orientés et considérons les catégories des graphes orientables et des graphes signés. Nous étudions enfin les différentes relations pouvant exister entre ces quatre types d'homomorphismes de graphes.
APA, Harvard, Vancouver, ISO, and other styles
6

Hoang, Chinh T. "Perfect graphs." Thesis, McGill University, 1985. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=74011.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Lamb, John D. "Theory of bond graphs." Thesis, University of Nottingham, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.239418.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Borinsky, Michael. "Graphs in perturbation theory." Doctoral thesis, Humboldt-Universität zu Berlin, 2018. http://dx.doi.org/10.18452/19201.

Full text
Abstract:
Inhalt dieser Arbeit ist eine Erweiterung der Hopfalgebrastruktur der Feynmangraphen und Renormierung von Connes und Kreimer. Zusätzlich wird eine Struktur auf faktoriell wachsenden Potenzreihen eingeführt, die deren asymptotisches Wachstum beschreibt und die kompatibel mit der Hopfalgebrastruktur ist. Die Hopfalgebrastruktur auf Graphen erlaubt die explizite Enumeration von Graphen mit Einschränkungen in Bezug auf die erlaubten Untergraphen. Im Fall der Feynmangraphen wird zusätzlich eine algebraische Verbandstruktur eingeführt, die weitere eindeutige Eigenschaften von physikalischen Quantenfeldtheorien aufdeckt. Der Differenzialring der faktoriell divergenten Potenzreihen erlaubt es asymptotische Resultate von implizit definierten Potenzreihen mit verschwindendem Konvergenzradius zu extrahieren. In Kombination ergeben beide Strukturen eine algebraische Formulierung großer Graphen mit Einschränkungen für die erlaubten Untergraphen. Diese Strukturen sind motiviert von null-dimensionaler Quantenfeldtheorie and werden zur Analyse ebendieser benutzt. Als reine Anwendung der Hopfalgebrastruktur wird eine hopfalgebraische Formulierung der Legendretransformation in Quantenfeldtheorien formuliert. Der Differenzialring der faktoriell divergenten Potenzreihen wird dazu benutzt zwei asymptotische Enumerationsprobleme zu lösen: Die asymptotische Anzahl der verbundenen Chorddiagramme und die asymptotische Anzahl der simplen Permutationen. Für beide asymptotischen Lösungen werden vollständige asymptotische Entwicklungen in Form von geschlossenen Erzeugendenfunktionen berechnet. Kombiniert werden beide Strukturen zur Anwendung an null-dimensionaler Quantenfeldtheorie. Zahlreiche Größen werden in den null-dimensionalen Varianten von phi^3, phi^4, QED, quenched QED and Yukawatheorie mit ihren kompletten asymptotischen Entwicklungen berechnet.<br>This thesis provides an extension of the work of Dirk Kreimer and Alain Connes on the Hopf algebra structure of Feynman graphs and renormalization to general graphs. Additionally, an algebraic structure of the asymptotics of formal power series with factorial growth, which is compatible with the Hopf algebraic structure, will be introduced. The Hopf algebraic structure on graphs permits the explicit enumeration of graphs with constraints for the allowed subgraphs. In the case of Feynman diagrams a lattice structure, which will be introduced, exposes additional unique properties for physical quantum field theories. The differential ring of factorially divergent power series allows the extraction of asymptotic results of implicitly defined power series with vanishing radius of convergence. Together both structures provide an algebraic formulation of large graphs with constraints on the allowed subgraphs. These structures are motivated by and used to analyze renormalized zero-dimensional quantum field theory at high orders in perturbation theory. As a pure application of the Hopf algebra structure, an Hopf algebraic interpretation of the Legendre transformation in quantum field theory is given. The differential ring of factorially divergent power series will be used to solve two asymptotic counting problems in combinatorics: The asymptotic number of connected chord diagrams and the number of simple permutations. For both asymptotic solutions, all order asymptotic expansions are provided as generating functions in closed form. Both structures are combined in an application to zero-dimensional quantum field theory. Various quantities are explicitly given asymptotically in the zero-dimensional version of phi^3, phi^4, QED, quenched QED and Yukawa theory with their all order asymptotic expansions.
APA, Harvard, Vancouver, ISO, and other styles
9

Olariu, Stephan. "Results on perfect graphs." Thesis, McGill University, 1986. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=73997.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Yang, Weihua. "Supereulerian graphs, Hamiltonicity of graphes and several extremal problems in graphs." Phd thesis, Université Paris Sud - Paris XI, 2013. http://tel.archives-ouvertes.fr/tel-00877793.

Full text
Abstract:
In this thesis, we focus on the following topics: supereulerian graphs, hamiltonian line graphs, fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees, and several extremal problems on the (minimum and/or maximum) size of graphs under a given graph property. The thesis includes six chapters. The first one is to introduce definitions and summary the main results of the thesis, and in the last chapter we introduce the furture research of the thesis. The main studies in Chapters 2 - 5 are as follows. In Chapter 2, we explore conditions for a graph to be supereulerian.In Section 1 of Chapter 2, we characterize the graphs with minimum degree at least 2 and matching number at most 3. By using the characterization, we strengthen the result in [93] and we also address a conjecture in the paper.In Section 2 of Chapter 2, we prove that if $d(x)+d(y)\geq n-1-p(n)$ for any edge $xy\in E(G)$, then $G$ is collapsible except for several special graphs, where $p(n)=0$ for $n$ even and $p(n)=1$ for $n$ odd. As a corollary, a characterization for graphs satisfying $d(x)+d(y)\geq n-1-p(n)$ for any edge $xy\in E(G)$ to be supereulerian is obtained. This result extends the result in [21].In Section 3 of Chapter 2, we focus on a conjecture posed by Chen and Lai [Conjecture~8.6 of [33]] that every 3-edge connected and essentially 6-edge connected graph is collapsible. We find a kind of sufficient conditions for a 3-edge connected graph to be collapsible.In Chapter 3, we mainly consider the hamiltonicity of 3-connected line graphs.In the first section of Chapter 3, we give several conditions for a line graph to be hamiltonian, especially we show that every 3-connected, essentially 11-connected line graph is hamilton- connected which strengthens the result in [91].In the second section of Chapter 3, we show that every 3-connected, essentially 10-connected line graph is hamiltonian-connected.In the third section of Chapter 3, we show that 3-connected, essentially 4-connected line graph of a graph with at most 9 vertices of degree 3 is hamiltonian. Moreover, if $G$ has 10 vertices of degree 3 and its line graph is not hamiltonian, then $G$ can be contractible to the Petersen graph.In Chapter 4, we consider edge fault-tolerant hamiltonicity of Cayley graphs generated by transposition trees. We first show that for any $F\subseteq E(Cay(B:S_{n}))$, if $|F|\leq n-3$ and $n\geq4$, then there exists a hamiltonian path in $Cay(B:S_{n})-F$ between every pair of vertices which are in different partite sets. Furthermore, we strengthen the above result in the second section by showing that $Cay(S_n,B)-F$ is bipancyclic if $Cay(S_n,B)$ is not a star graph, $n\geq4$ and $|F|\leq n-3$.In Chapter 5, we consider several extremal problems on the size of graphs.In Section 1 of Chapter 5, we bounds the size of the subgraph induced by $m$ vertices of hypercubes. We show that a subgraph induced by $m$ (denote $m$ by $\sum\limits_{i=0}^ {s}2^{t_i}$, $t_0=[\log_2m]$ and $t_i= [\log_2({m-\sum\limits_{r=0}^{i-1}2 ^{t_r}})]$ for $i\geq1$) vertices of an $n$-cube (hypercube) has at most $\sum\limits_{i=0}^{s}t_i2^{t_i-1} +\sum\limits_{i=0}^{s} i\cdot2^{t_i}$ edges. As its applications, we determine the $m$-extra edge-connectivity of hypercubes for $m\leq2^{[\frac{n}2]}$ and $g$-extra edge-connectivity of the folded hypercube for $g\leq n$.In Section 2 of Chapter 5, we partially study the minimum size of graphs with a given minimum degree and a given edge degree. As an application, we characterize some kinds of minimumrestricted edge connected graphs.In Section 3 of Chapter 5, we consider the minimum size of graphs satisfying Ore-condition.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Graphs theory"

1

Golumbic, Martin Charles. Algorithmic graph theory and perfect graphs. Elsevier, 2004.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Golumbic, Martin Charles. Algorithmic graph theory and perfect graphs. 2nd ed. North Holland, 2004.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kandasamy, W. B. Vasantha. Groups as graphs. Editura CuArt, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Cvetković, Dragoš M. Eigenspaces of graphs. Cambridge University Press, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Pesch, Erwin. Retracts of graphs. Athenaum, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Cvetković, Dragoš M. Eigenspaces of graphs. Cambridge University Press, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Borinsky, Michael. Graphs in Perturbation Theory. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-03541-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Thulasiraman, K., and M. N. S. Swamy. Graphs: Theory and Algorithms. John Wiley & Sons, Inc., 1992. http://dx.doi.org/10.1002/9781118033104.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Berge, Claude. The theory of graphs. Dover, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

S, Swamy M. N., ed. Graphs: Theory and algorithms. Wiley, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Graphs theory"

1

Kimoto, Kazufumi. "Generalized Group–Subgroup Pair Graphs." In International Symposium on Mathematics, Quantum Theory, and Cryptography. Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-5191-8_14.

Full text
Abstract:
Abstract A regular finite graph is called a Ramanujan graph if its zeta function satisfies an analog of the Riemann Hypothesis. Such a graph has a small second eigenvalue so that it is used to construct cryptographic hash functions. Typically, explicit family of Ramanujan graphs are constructed by using Cayley graphs. In the paper, we introduce a generalization of Cayley graphs called generalized group–subgroup pair graphs, which are a generalization of group–subgroup pair graphs defined by Reyes-Bustos. We study basic properties, especially spectra of them.
APA, Harvard, Vancouver, ISO, and other styles
2

Kurasov, Pavel. "Standard Laplacians and Secular Polynomials." In Operator Theory: Advances and Applications. Springer Berlin Heidelberg, 2023. http://dx.doi.org/10.1007/978-3-662-67872-5_6.

Full text
Abstract:
AbstractIn this chapter we start systematic studies of spectral properties of graph Laplacians—standard Laplace operators on metric graphs. Our main interest will be families of metric graphs having the same topological structure. Metric graphs from such a family correspond to the same discrete graph but the lengths of the edges may be different. Common spectral properties of such families (and hence of all metric graphs) are best described by certain multivariate low degree polynomials.
APA, Harvard, Vancouver, ISO, and other styles
3

Diestel, Reinhard. "Random Graphs." In Graph Theory. Springer Berlin Heidelberg, 2017. http://dx.doi.org/10.1007/978-3-662-53622-3_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Diestel, Reinhard. "Planar Graphs." In Graph Theory. Springer Berlin Heidelberg, 2017. http://dx.doi.org/10.1007/978-3-662-53622-3_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Diestel, Reinhard. "Infinite Graphs." In Graph Theory. Springer Berlin Heidelberg, 2017. http://dx.doi.org/10.1007/978-3-662-53622-3_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Diestel, Reinhard. "Random Graphs." In Graph Theory. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-642-14279-6_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Diestel, Reinhard. "Planar Graphs." In Graph Theory. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-642-14279-6_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Diestel, Reinhard. "Infinite Graphs." In Graph Theory. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-642-14279-6_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Trotter, T. "Ramsey Theory." In Graphs and Order. Springer Netherlands, 1985. http://dx.doi.org/10.1007/978-94-009-5315-4_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Brouwer, Andries E., Arjeh M. Cohen, and Arnold Neumaier. "Representation Theory." In Distance-Regular Graphs. Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/978-3-642-74341-2_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Graphs theory"

1

Nomura, Saki, Junya Hara, Hiroshi Higashi, and Yuichi Tanaka. "Dynamic Sensor Placement on Graphs Based on Graph Signal Sampling Theory." In 2024 Asia Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA ASC). IEEE, 2024. https://doi.org/10.1109/apsipaasc63619.2025.10848795.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Oren-Loberman, Mor, Vered Paslev, and Wasim Huleihel. "Testing Dependency of Weighted Random Graphs." In 2024 IEEE International Symposium on Information Theory (ISIT). IEEE, 2024. http://dx.doi.org/10.1109/isit57864.2024.10619266.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kovalev, Mikhail Dmitrievich. "On structural graphs of theory of mechanisms." In Academician O.B. Lupanov 14th International Scientific Seminar "Discrete Mathematics and Its Applications". Keldysh Institute of Applied Mathematics, 2022. http://dx.doi.org/10.20948/dms-2022-74.

Full text
Abstract:
It is shown that the graph commonly used by machine scientists in the analysis structures of mechanisms does not always carry complete information about the structure. It is proposed to use more suitable graphs, in particular, a weighted graph that carries complete information.
APA, Harvard, Vancouver, ISO, and other styles
4

Mota, Guilherme Oliveira. "Advances in anti-Ramsey theory for random graphs." In II Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2017. http://dx.doi.org/10.5753/etc.2017.3204.

Full text
Abstract:
Dados grafos G e H, denotamos a seguinte propriedade por G ÝrÑpb H: para toda coloração própria das arestas de G (com uma quantidade arbitrária de cores) existe uma cópia multicolorida de H em G, i.e., uma cópia de H sem duas arestas da mesma cor. Sabe-se que, para todo grafo H, a função limiar prHb prHbpnq para essa propriedade no grafo aleatório binomial Gpn; pq é assintoticamente no máximo n 1{mp2qpHq, onde mp2qpHq denota a assim chamada 2-densidade máxima de H. Neste trabalho discutimos esse e alguns resultados recentes no estudo de propriedades anti-Ramsey para grafos aleatórios, e mostramos que se H C4 ou H K4 então prHb n 1{mp2qpHq, que está em contraste com os fatos conhecidos de que prCbk n 1{mp2qpCkq para Let r be a positive integer and let G and H be graphs. We denote by G Ñ pHqr the property that any colouring of the edges of G with at most r colours contains a monochromatic copy of H in G. In 1995, Ro¨dl and Rucin´ski determined the threshold for the property Gpn; pq Ñ pHqr for all graphs H. The maximum 2-density mp2qpHq of a graph H is denoted by mp2qpHq max ! ||VEppJJqq|| 12 : J € H; |V pJ q| ¥ 3) ; where we suppose |V pHq| ¥ 3.
APA, Harvard, Vancouver, ISO, and other styles
5

Oliveira, Daniel, Carlos Magno Abreu, Eduardo Ogasawara, Eduardo Bezerra, and Leonardo De Lima. "A Science Gateway to Support Research in Spectral Graph Theory." In XXXIV Simpósio Brasileiro de Banco de Dados. Sociedade Brasileira de Computação - SBC, 2019. http://dx.doi.org/10.5753/sbbd.2019.8826.

Full text
Abstract:
Describing classes of graphs that optimize a function of the eigenvalues subject to some constraints is one of the topics addressed by Spectral Graph Theory (SGT). In this paper, we propose RioGraphX, a science gateway developed on top of Apache Spark, which aims to obtain all graphs that optimize a given mathematical function of the eigenvalues of a graph. Initial experiments involving small graphs have pointed out optimal graphs in a reasonable computational time, and also have shown that leveraging parallel processing is a promising approach to handle larger graphs.
APA, Harvard, Vancouver, ISO, and other styles
6

Devi, M. Manjula, and K. Karuppasamy. "Application of graph theory in chemical graphs." In INTELLIGENT BIOTECHNOLOGIES OF NATURAL AND SYNTHETIC BIOLOGICALLY ACTIVE SUBSTANCES: XIV Narochanskie Readings. AIP Publishing, 2023. http://dx.doi.org/10.1063/5.0179080.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

De Silva, K. H. C., and A. A. I. Perera. "Odd Prime Labeling of Snake Graphs." In SLIIT 2nd International Conference on Engineering and Technology. SLIIT, 2023. http://dx.doi.org/10.54389/lufm4069.

Full text
Abstract:
Graph theory is one of the branches of mathematics which is concerned with the networks of points connected by lines. One of the most important research areas in graph theory is graph labeling, which dates back to the 1960s. Graph labeling is assigning integers to the vertices, edges, or both depending on conditions. Labeled graphs are helpful in mathematical models for a wide range of applications such as in coding theory, circuit theory, computer networks, and in cryptography as well. There are various types of graph labeling techniques in graph theory such as radio labeling, graceful labeling, prime labeling, antimagic labeling, and lucky labeling, etc. In this research, we use one of the variations of prime labeling called odd prime labeling of snake graphs. Recent works on odd prime labeling investigate about families of snake graphs, complete graphs, etc and there they discuss about one odd integer sequence only. In this research, we introduce odd prime labeling method for snake graphs for any odd integer sequence and we give a proof for it as well. KEYWORDS: snake graph, odd sequences, odd prime labeling, relatively prime
APA, Harvard, Vancouver, ISO, and other styles
8

Varma, Rohan A., and Jelena Kovacevic. "SAMPLING THEORY FOR GRAPH SIGNALS ON PRODUCT GRAPHS." In 2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP). IEEE, 2018. http://dx.doi.org/10.1109/globalsip.2018.8646362.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Krishnan, Prasad. "Coded Caching via Line Graphs of Bipartite Graphs." In 2018 IEEE Information Theory Workshop (ITW). IEEE, 2018. http://dx.doi.org/10.1109/itw.2018.8613527.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

"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

Reports on the topic "Graphs theory"

1

Mesbahi, Mehran. Dynamic Security and Robustness of Networked Systems: Random Graphs, Algebraic Graph Theory, and Control over Networks. Defense Technical Information Center, 2012. http://dx.doi.org/10.21236/ada567125.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Gennip, Yves van, Nestor Guillen, Braxton Osting, and Andrea L. Bertozzi. Mean Curvature, Threshold Dynamics, and Phase Field Theory on Finite Graphs. Defense Technical Information Center, 2013. http://dx.doi.org/10.21236/ada581612.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Hrebeniuk, Bohdan V. Modification of the analytical gamma-algorithm for the flat layout of the graph. [б. в.], 2018. http://dx.doi.org/10.31812/123456789/2882.

Full text
Abstract:
The planarity of graphs is one of the key sections of graph theory. Although a graph is an abstract mathematical object, most often it is graph visualization that makes it easier to study or develop in a particular area, for example, the infrastructure of a city, a company’s management or a website’s web page. In general, in the form of a graph, it is possible to depict any structures that have connections between the elements. But often such structures grow to such dimensions that it is difficult to determine whether it is possible to represent them on a plane without intersecting the bonds. There are many algorithms that solve this issue. One of these is the gamma method. The article identifies its problems and suggests methods for solving them, and also examines ways to achieve them.
APA, Harvard, Vancouver, ISO, and other styles
4

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Shukla, Dr Minal. Exploring Graph Theory to Enhance Performance of Blockchain. ResearchHub Technologies, Inc., 2024. http://dx.doi.org/10.55277/researchhub.w5pebey6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Graphs theory' for particular source types:
Journal articles Dissertations / Theses Books
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!

To the bibliography