Search results

...op graph''' is a special type of [[graph (graph theory)|graph]] consisting of a [[complete graph]] (clique) on ''m'' vertices and a [[path graph]] on ''n ...mute time]].<ref>{{cite journal|last1=Jonasson|first1=Johan|title=Lollipop graphs are extremal for commute times|journal=Random Structures and Algorithms|dat ...

...ohn|title=Fibonacci number of the tadpole graph|journal=Electronic Journal of Graph Theory and Applications|date=2014|volume=2|issue=2|pages=129–138|doi= [[Category:Parametric families of graphs]] ...

In the [[mathematics|mathematical]] field of [[graph theory]], the '''ladder graph''' {{mvar|L{{sub|n}}}} is a [[planar ...993.</ref><ref>Noy, M. and Ribó, A. "Recursively Constructible Families of Graphs." Adv. Appl. Math. 32, 350-363, 2004.</ref> ...

{{short description|Family of triangle-free circulant graphs}} [[File:Andrásfai-gráf (n=4).jpg|thumb|260px| Two drawings of the {{math|And(4)}} graph]] ...

...lues for a set of [[parameter]]s.<ref>{{Cite journal |date=2006 |title=All of Nonparametric Statistics |url=https://link.springer.com/book/10.1007/0-387- Common examples are parametrized (families of) [[Function (mathematics)|functions]], [[probability distribution]]s, curv ...

{{Short description|Class of simple graphs defined from vector spaces}} ...aces of an {{mvar|n}}-dimensional [[vector space]] over a [[finite field]] of order {{mvar|q}}; two vertices are adjacent when their [[intersection (set ...

...e]], a space of <math>m</math> circles joined at a point. When the context of graph theory is clear, it can be called more simply a '''bouquet'''.{{r|bw} ...raph.svg|thumb|upright=1.1|[[Ribbon graph]] representation of an embedding of <math>B_3</math> onto the [[projective plane]].]] ...

...an be formed from a [[complete graph]] by adding a new vertex to each edge of the complete graph, extending it to an order-3 hyperedge.{{r|cfr|fl}} The properties of this hypergraph make it of interest in [[Ramsey theory]].{{r|cfr|fl}} ...

...(MST) of a graph whose edge weights are changing as a continuous function of time. == H-minor-free graphs == ...

{{short description|Graph family made by joining complete graphs at a universal node}} ...lian |title=A dynamic survey of graph labeling |journal=Electronic Journal of Combinatorics |volume=DS6 |pages=1–58 |date=3 January 2007 |url=http://www. ...

...]]s with [[Diameter (graph theory)|diameter]] two, and with a large number of vertices relative to their diameter and [[degree (graph theory)|degree]]. T ...ph]]s can exist, with degree 57. For all other degrees, the maximum number of vertices in a diameter-two graph must be smaller. ...

[[File:J5 circular color.svg|300px|right|thumb|The [[chromatic number]] of the [[flower snark]] {{math|''J''₅}} is 3, but the ''circular ch ...any of the following definitions, all of which are equivalent (for finite graphs). ...

...angle [[Graph (discrete mathematics)|graphs]], which are used in the field of [[edge coloring]] in particular. :''A Shannon multigraph is [[multigraph]] with 3 vertices for which either of the following conditions holds:'' ...

...]] by adding to it a [[perfect matching]] that connects ''opposite'' pairs of hypercube vertices. ...identification|identifying]] together (or contracting) every opposite pair of vertices. ...

{{Short description|Pattern of states and moves in the Tower of Hanoi puzzle}} ...of Hanoi]] puzzle, and whose edges represent allowable moves between pairs of states. ...

{{short description|Mathematical graph of a Sudoku}} ...s that belong to the same row, column, or block of the puzzle. The problem of solving a Sudoku puzzle can be represented as [[precoloring extension]] on ...

{{Short description|Graph of triangles with a shared vertex}} [[File:Friendship graphs.svg|thumb|upright=1.8|The friendship graphs {{math|''F''{{sub|2}}}}, {{math|''F''{{sub|3}}}} and {{math|''F''{{sub|4}}} ...

{{Short description|Type of graph in mathematics}} ...mplete bipartite graph]] on the same vertices. The name was given to these graphs by [[Paul Erdős]] and [[András Hajnal]].{{r|e}} ...

{{Short description|Graph of the vertices and edges of a demihypercube}} ...wer|A.E. Brouwer]], A.M. Cohen, and A. Neumaier (1989), ''Distance Regular Graphs''. Berlin, New York: Springer-Verlag, p. 265. {{ISBN|3-540-50619-5}}, {{I ...

{{Short description|Type of multigraph}} ...]] [[multigraph]], whose vertices represent [[Bit array|binary sequence]]s of a given length and whose edges represent two operations on these sequence, ...