Search results

{{hatnote|An incidence graph is a [[Levi graph]].}} ...rtex (graph theory)|vertex]] is '''incident''' with an [[Glossary of graph theory terms#edge|edge]] if the vertex is one of the two vertices the edge connect ...

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

{{Short description|Semi-symmetric cubic graph with 110 vertices and 165 edges}} {{Infobox graph ...

{{infobox graph ...ph|Hamiltonian]]<br>[[Semi-symmetric graph|Semi-symmetric]]<br>[[Bipartite graph|Bipartite]] ...

...l" because a [[perfect matching]] is able to be created with the remaining graph (cycle 3 leaves no vertices, automatically filling this criteria). Right: A Pfaffian Orientation of the graph on the left, where the edges of the 3 cycles from the right have an odd num ...

...ized family''' is a [[indexed family|family]] of objects (a set of related objects) whose differences depend only on the chosen values for a set of [[paramete ...rmal distribution.svg|alt=A graph of several normal distributions.|thumb|A graph of the probability density functions of several [[normal distributions]] (f ...

...every graph can be encoded as an ultragraph, and similarly, every infinite graph giving an Exel-Laca algebras can also be encoded as an ultragraph. ...is a singleton, and ultragraphs may be thought of as generalized directed graph in which each edges starts at a single vertex and points to a nonempty subs ...

...ted graph]] or [[quiver (mathematics)|quiver]] is the [[category (category theory)|category]] that results from freely concatenating arrows together, wheneve ...tegory are the vertices of the quiver, and the morphisms are paths between objects. Here, a '''path''' is defined as a [[finite sequence]] ...

{{Short description|Cyclic order and one-to-one pairing of a set of objects}} ...ose objects. Chord diagrams are conventionally visualized by arranging the objects in their order around a [[circle]], and drawing the pairs of the matching a ...

...ossom tree is associated with an [[Graph embedding|embedding]] of a planar graph. Blossom trees can be used to [[sampling (statistics)|sample]] random plana ...y.<ref name=":0">{{Cite book|title = Physical and Numerical Models in Knot Theory: Including Applications to the Life Sciences|url = https://books.google.com ...

...outside of the subset. Equivalently, a nonblocker is the [[Complement (set theory)|complement]] of a [[dominating set]].{{r|dffpr}} The computational problem of finding the largest nonblocker in a graph was formulated by {{harvtxt|Papadimitriou|Yannakakis|1991}}, who observed t ...

...versal of size 2: removing the two blue bottom vertices leaves a bipartite graph.]] ...the vertices of an odd cycle transversal from a graph leaves a [[bipartite graph]] as the remaining [[induced subgraph]].{{r|pa}} ...

...superscript minus means minus the given symplectic form (for example, the graph of a [[symplectomorphism]]; hence, minus). The notion was introduced by [[A [[Category:Category theory]] ...

{{Short description|Element of graph theory}} ...each cycle edge that make the resulting directed graph [[Directed acyclic graph|acyclic]]. Two orientations are shown as adjacent when they differ in the d ...

{{short description|24-vertex symmetric bipartite cubic graph}} {{infobox graph ...

..., except one which induces a graph with maximum degree&nbsp;''b''. If this graph is also a forest, then we call this a ''' F(''a'',&nbsp;''b'')-decompositio A graph with [[arboricity]] ''a'' is (''a'',&nbsp;0)-decomposable. Every (''a'',&nb ...

{{short description|Method of graph decomposition}} ...3x3 grid graph haven.svg|thumb|A bramble of order four in a 3&times;3 grid graph, consisting of six mutually touching connected subgraphs]] ...

...f the same color is an induced matching. Each color is a [[Matching (graph theory)|matching]] because none of these edges share a vertex, and is an [[induced ...imum number of colors (induced matchings) needed to cover the graph is the graph's '''strong chromatic index'''.]] ...

...gy]], as a graph is a special case of a simplicial complex. Since a finite graph is a 1-complex (i.e., its 'faces' are the vertices - which are 0-dimensiona ...The example below explains these symbols and concepts in full detail on a graph. ...

{{Short description|Set of related problems in graph theory}} ...ects ("pebbles") from vertex to vertex in a [[Graph (discrete mathematics)|graph]] with a constraint on the number of pebbles that can occupy a vertex at an ...