Search results

{{infobox graph | name = Tadpole graph ...

...s" or "tangledness". Many naturally occurring families of graphs are Lévy families. Many mathematicians have noted this fact and have expressed surprise that ...he [[graph diameter]] of ''G'', and ''A''_(''n'') is the ''n''-[[graph neighborhood]] of ''A''. Note that the maximization ranges over subsets '' ...

...te mathematics)|graph]] ''G''. It was motivated by the [[Colin de Verdière graph invariant]]. ...[[Rank (linear algebra)|rank]] of any generalized adjacency matrix of the graph; it is denoted by <math>\operatorname{mr} (G)</math>. ...

{{distinguish|text = the [[Heawood graph]], which is a member of the Heawood graph family}} ...'Heawood family''' refers to either one of the following two related graph families generated via [[ΔY- and YΔ-transformations]]: ...

{{infobox graph | name = Lollipop graph ...

{{Short description|Graph with all path lengths between each two vertices}} ...math>n-1</math>, where <math>n</math> is the number of vertices. Thus, the graph shown is panconnected.]] ...

{{Short description|Planar, undirected graph with 2n vertices and 3n-2 edges}} {{infobox graph ...

...matrix are integers.<ref>{{MathWorld|urlname=IntegralGraph|title=Integral Graph|mode=cs2}}</ref> | title = Graphs and Combinatorics: Proceedings of the Capital Conference on Graph Theory and Combinatorics at the George Washington University, Washington, D ...

...>, with <math>h(G)</math> defined to be the length of the longest cycle in graph <math>G</math>, the shortness exponent is defined as<ref name="gw">{{citati | title = Shortness exponents of families of graphs ...

{{infobox graph | image = Andrásfai graph And(6).svg ...

{{Short description|Graph whose embedding in a Euclidean space forms a regular tiling}} [[File:Square grid graph.svg|thumb|[[Square tiling|Square grid]] graph]] ...

..., 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}} [[File:Self-trial ribbon graph.svg|thumb|upright=1.1|[[Ribbon graph]] representation of an embedding of <math>B_3</math> onto the [[projective ...

{{Short description|Mathematical Graph}} ...thought of as a [[spectral graph theory]] analogue of [[vertex-transitive graph]]s. ...

...D.svg|300px|right|Depiction of the ΔY- and YΔ-transformations applied to a graph]] ...(discrete mathematics)|graphs]]. A ΔY-transformation replaces a [[triangle graph|triangle]] by a vertex of [[vertex degree|degree]] three; and conversely, a ...

...is case, 22 <math>></math> 20.]]{{unsolved|mathematics|'''Conjecture:''' A graph ''G'' with <math>\Delta (G) > n/3</math> is class 2 [[if and only if]] it h ...lows. An alternate, stricter definition of an overfull subgraph ''S'' of a graph ''G'' requires <math>\displaystyle\Delta (G) = \Delta (S)</math>. ...

{{Graph families defined by their automorphisms}} In [[graph theory|graph-theoretic mathematics]], a '''biregular graph'''<ref>{{citation ...

{{infobox graph ...aph|Hypohamiltonian]] (both)<br>[[Cubic graph|Cubic]] (both)<br>[[Toroidal graph|Toroidal]] (only one)<ref>{{cite journal | title=Blanuša double |author1=Or ...

{{short description|Directed acyclic graph with ≤1 directed paths between any two nodes}} ...ph theory#subgraph|subgraph]] reachable from any vertex induces an [[Tree (graph theory)|undirected tree]], or a [[partially ordered set]] (poset) that does ...

[[File:Complex tripartite graph octahedron.svg|thumb|The graph of an [[octahedron]] is complete multipartite ({{math|''K''_2,2,2 ..., a subfield of mathematics, a '''well-colored graph''' is an [[undirected graph]] for which [[greedy coloring]] uses the same number of colors regardless o ...

{{Infobox graph |name=Grassmann graph ...