Search results
Jump to navigation
Jump to search
Page title matches
- In the [[mathematics|mathematical]] field of [[graph theory]], the '''Klein graphs''' are two different but related [[regular graph]]s, each with 84 edges. Ea | title = Trivalent symmetric graphs up to 768 vertices ...6 KB (788 words) - 00:24, 25 April 2024
- ...al operation that can be used in these sentences. The first-order logic of graphs concerns sentences in which the variables and predicates concern individual A sentence <math>S</math> may be true for some graphs, and false for others; a graph <math>G</math> is said to ''model'' <math>S< ...40 KB (5,588 words) - 12:30, 25 October 2024
- ...137/18M1210459</ref> Informally, a family of graphs has few cliques if the graphs do not have a large number of large [[Cluster (statistics)|clusters.]] ...ible maximal cliques has computational ramifications for [[algorithm]]s on graphs or networks. ...6 KB (972 words) - 17:30, 12 November 2023
- ...e of "compactness" or "tangledness". Many naturally occurring families of graphs are Lévy families. Many mathematicians have noted this fact and have expre Formally, a family of graphs ''G<sub>n</sub>'', ''n'' = 1, 2, 3, ..., is a Lévy ...2 KB (397 words) - 22:54, 22 May 2019
- ...ted 3-regular ([[Cubic graph|cubic]]) [[Simple graph#Simple graph|simple]] graphs are listed for small vertex numbers. ...nnected and 2-connected graphs are defined as usual. This leaves the other graphs in the 3-connected class because each ...31 KB (2,757 words) - 03:42, 30 December 2024
- '''Differentially private analysis of graphs'''<ref>{{cite journal |title=Differentially Private Analysis of Graphs ...6 KB (857 words) - 05:03, 12 April 2024
- '''Phase-field models on graphs''' are a discrete analogue to [[phase-field models]], defined on a [[graph ...st2=Flenner |first2=A. |date=2012-01-01 |title=Diffuse Interface Models on Graphs for Classification of High Dimensional Data |journal=Multiscale Modeling & ...4 KB (532 words) - 12:15, 25 October 2024
- ...ifference equations]], or [[Calculus of variations|variational models]] on graphs which can be interpreted as discrete versions of [[partial differential equ ...[weight function]]. Differential equations or difference equations on such graphs can be employed to leverage the graph's structure for tasks such as [[image ...22 KB (3,578 words) - 04:39, 1 March 2025
- '''''The Strange Logic of Random Graphs''''' is a book on [[zero-one law]]s for [[random graph]]s. It was written b ...ction. A zero-one law is a theorem stating that, for certain properties of graphs, and for certain choices of <math>p</math>, ...4 KB (607 words) - 03:35, 19 February 2025
- '''''Elementary Number Theory, Group Theory and Ramanujan Graphs''''' is a book in mathematics whose goal is to make the construction of [[R ...y edges connecting it to the remaining parts of the graph. Sparse expander graphs have many important applications in computer science, including the develop ...8 KB (1,129 words) - 08:01, 18 February 2025
Page text matches
- * [https://www.win.tue.nl/~aeb/graphs/Suzuki.html A. E. Brouwer's website: the Suzuki graph] [[Category:Individual graphs]] ...862 bytes (98 words) - 01:41, 7 December 2024
- | title = Distance-regular graphs * [http://www.win.tue.nl/~aeb/graphs/Sylvester.html A.E. Brouwer's website: the Sylvester graph] ...1,018 bytes (110 words) - 01:29, 22 April 2024
- * the family of 20 graphs generated from the [[complete graph]] <math>K_7</math>. * the family of 78 graphs generated from <math>K_7</math> and <math>K_{3,3,1,1}</math>. ...5 KB (679 words) - 23:46, 26 November 2024
- ...on <math>\ell</math> but not depend on the choice of vertex. Walk-regular graphs can be thought of as a [[spectral graph theory]] analogue of [[vertex-trans ...et/a/264155|title=Are there only finitely many distinct cubic walk-regular graphs that are neither vertex-transitive nor distance-regular?|website=mathoverfl ...4 KB (638 words) - 20:58, 2 December 2024
- | contribution = Which graphs have integral spectra? | title = Graphs and Combinatorics: Proceedings of the Capital Conference on Graph Theory an ...4 KB (507 words) - 16:53, 29 January 2023
- | journal = Graphs and Combinatorics | title = Uniqueness and nonexistence of some graphs related to {{math|''M''<sub>22</sub>}} ...2 KB (273 words) - 01:46, 24 July 2024
- == Bull-free graphs == ...or2-link=Najiba Sbihi|title=Recognizing bull-free perfect graphs|journal=[[Graphs and Combinatorics]]|volume=11|year=1995|pages=171–178|issue=2|doi=10.1007/B ...4 KB (522 words) - 00:07, 17 October 2024
- | title = Fast generation of regular graphs and construction of cages It is one of the four [[cage graph|(5,5)-cage graphs]], the others being the [[Foster cage]], the [[Robertson–Wegner graph]], an ...1 KB (169 words) - 01:44, 24 July 2024
- ...]. We ask: When are two graphs the same? (i.e., [[graph isomorphism]]) The graphs in question may be expressed differently in terms of graph equations.<ref>[ What are the graphs ([[solution (equation)|solutions]]) ''G'' and ''H'' such that the [[line gr ...2 KB (348 words) - 14:50, 8 July 2022
- | title = Distance-Regular Graphs * [http://www.win.tue.nl/~aeb/graphs/Wells.html A.E. Brouwer's website: The Armanios-Wells graph] ...1 KB (135 words) - 20:54, 15 May 2024
- ...e of "compactness" or "tangledness". Many naturally occurring families of graphs are Lévy families. Many mathematicians have noted this fact and have expre Formally, a family of graphs ''G<sub>n</sub>'', ''n'' = 1, 2, 3, ..., is a Lévy ...2 KB (397 words) - 22:54, 22 May 2019
- | title = Fast generation of regular graphs and construction of cages | year = 1999}}.</ref> It is one of the four [[cage graph|(5,5)-cage graphs]], the others being the [[Meringer graph]], the [[Robertson–Wegner graph]], ...1 KB (177 words) - 09:09, 17 July 2020
- | title = Fast generation of regular graphs and construction of cages | year = 1999}}.</ref> It is one of the four [[cage graph|(5,5)-cage graphs]], the others being the [[Foster cage]], the [[Meringer graph]], and the [[ ...1 KB (184 words) - 01:39, 24 July 2024
- ...graphs do not have longer cycles. More precisely, for any ordering of the graphs in <math>{\mathcal F}</math> into a sequence <math>G_0, G_1, \dots</math>, | title = Shortness exponents of families of graphs ...4 KB (528 words) - 22:18, 15 August 2023
- ...<math>a_{i+1} = b_i</math> for all <math> 1 \leq i \leq k-1 </math>. Shift graphs are [[Triangle-free graph|triangle-free]], and for fixed <math>k</math> the | contribution = On chromatic number of infinite graphs ...4 KB (607 words) - 22:47, 9 December 2024
- ...mute time]].<ref>{{cite journal|last1=Jonasson|first1=Johan|title=Lollipop graphs are extremal for commute times|journal=Random Structures and Algorithms|dat [[Category:Parametric families of graphs]] ...2 KB (272 words) - 00:10, 2 May 2024
- | title = Panconnected graphs Panconnected graphs are necessarily [[pancyclic graph|pancyclic]]: if {{math|''uv''}} is an [[e ...3 KB (393 words) - 05:25, 2 February 2025
- '''''The Strange Logic of Random Graphs''''' is a book on [[zero-one law]]s for [[random graph]]s. It was written b ...ction. A zero-one law is a theorem stating that, for certain properties of graphs, and for certain choices of <math>p</math>, ...4 KB (607 words) - 03:35, 19 February 2025
- {{Short description|Abstraction of 2-colorable graphs}} ==Relation to bipartite graphs== ...3 KB (398 words) - 06:39, 29 January 2023
- ...edges as <math>H</math>. The problem is [[APX-hard]], unless the two input graphs <math>G</math> and <math>G'</math> are required to have the same number of ...2 KB (220 words) - 13:22, 27 November 2024