Search results

{{Short description|Topological space arising from a usual graph}} ...pological space]] which arises from a usual [[graph (discrete mathematics)|graph]] <math>G = (E, V)</math> by replacing vertices by points and each edge <ma ...

[[File:Uniform tree.svg|thumb|300px|Section of the uniform tree for graph <math>G</math>]] ...[tree (graph theory)|tree]] which is the [[universal cover]] of a [[finite graph]]. Equivalently, the full [[automorphism group]] G=Aut(X) of the tree, whic ...

...ots, T_m</math> each containing <math>n</math> leaves. The leaves of these trees are given labels from some set <math>L</math> with <math>|L|=n</math> so th ....|date=1997-12-01|title=Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms|journal=SIAM Journal on Computing|volume= ...

{{Short description|Undirected graph with graph distances linearly bounded w.r.t. Euclidean distances}} [[File:Yao graph.svg|thumb|right|200px]] ...

{{Short description|Graph-theoretic connectivity parameter}} {{infobox graph ...

{{Short description|Trees with additional directed half edges}} ...print= 1305.1312v3|title= Generic method for bijections between blossoming trees and planar maps|date=2015|class= math.CO}}</ref> ...

...heorem in graph theory describing number of edge-disjoint spanning trees a graph can have}} ...[spanning tree]]s (and more generally [[Forest (graph theory)|forests]]) a graph can have: ...

{{Short description|Formula in graph theory}} In [[graph theory]], a '''deletion-contraction formula / recursion''' is any formula of the f ...

{{Short description|Algebraic structure in network theory}} ...tps://books.google.com/books?id=kAcBm96mUvsC&pg=PA332| title=Applied Graph Theory | isbn=9780444601933 | date=2 December 2012 |publisher=North-Holland|chapte ...

{{Short description|Graph width parameter used in graph theory}} '''Rank-width''' is a graph width parameter used in [[graph theory]] and [[parameterized complexity]], and defined using [[linear algebra]]. ...

...allel computation]] of solutions to common problems in [[algorithmic graph theory]]. It was introduced by Tarjan and Vishkin in 1984.<ref name="Tarjan">{{Cit ...takes to sort ''n'' items in parallel) if the tree has ''n'' nodes, as in trees the number of edges is one less than the number of nodes. ...

{{Short description|A graph class}} | image1 = Pairwise compatibility graph.jpg ...

...either <math>T</math> nor <math>K</math> as [[induced subgraph]]s can be [[graph coloring|properly colored]] using only a constant number of colors. Equival ...hese graphs, one can obtain graphs that avoid any fixed choice of a cyclic graph and clique (of more than two vertices) as induced subgraphs, and exceed any ...

...ely related to [[Kirchhoff's theorem]] on counting the spanning trees of a graph, from which it can be derived.{{r|williams}} It was first stated by {{harvt ...es for the states of the Markov chain, defined to be [[Tree (graph theory)|trees]], directed toward a designated root, in which all directed edges are valid ...

In [[probability theory]], a '''random recursive tree''' is a [[rooted tree]] chosen [[Discrete uni ...ering of the children of each vertex. In a random recursive tree, all such trees are equally likely. ...

{{short description|Tree graph with all nodes within distance 1 from central path}} {{about|graph theory|the shrub|Plumeria alba}} ...

...describes some properties of objects such as [[Tree (graph theory)|rooted trees]] and [[vector field]]s on [[affine space]]. ...as been introduced by [[Murray Gerstenhaber]] in his work on [[Deformation theory|deformations]] of algebras. ...

{{Short description|Cubic graph with 8 vertices and 12 edges}} {{infobox graph ...

{{Short description|Graph of zero divisors of a commutative ring}} ...visor graph that is a [[tree (graph theory)|tree]] but not a [[star (graph theory)|star]]]] ...

...)|trees]] with seven labeled nodes.<ref>{{Cite OEIS|A000272|name=Number of trees on n labeled nodes: n^(n-2)}}</ref> ...