Search results

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

...e vertices of the graph, then a convex <math>X</math>-embedding embeds the graph in such a way that every vertex either belongs to <math>X</math> or is plac ...his way will be a convex polygon, resulting in a [[convex drawing]] of the graph.{{r|tutte}} ...

{{Short description|Graph invariant}} ...ty 2.svg|thumb|upright=1.2|A cubicity 2 graph realized as the intersection graph of unit cubes, i.e. squares, in the plane.]] ...

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

The graph of ''ƒ''(''x'')&nbsp;=&nbsp;|''x''| has reach zero. | title = Geometric measure theory ...

...ace 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 ...

...is is an example of a graph with sphericity 2, also known as a [[unit disk graph]].]] ...doi.org/10.1016/0095-8956%2883%2990057-6 |journal=Journal of Combinatorial Theory, Series B |language=en |volume=35 |issue=3 |pages=309–318 |doi=10.1016/0095 ...

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

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

...figure]] that has one single surface, two edges, and four [[Vertex (graph theory)|vertices]]. ...ricon]] but without straight lines. Instead of that, it has [[Circular-arc graph|circular arcs]] of arbitrary [[radius]]. For this reason, when rolled over ...

{{Short description|Graph describing a topological embedding}} ...mb|upright=1.5|A graph-encoded map (gray triangles and colored edges) of a graph in the plane (white circles and black edges)]] ...

{{Short description|Graph representing a permutation}} ...tion graph.svg|thumb|300px|The permutation graph and the [[Matching (graph theory)|matching]] diagram for the permutation {{math|(4,3,5,1,2)}}]] ...

{{short description|Graph made from vertices and edges of a convex polyhedron}} [[File:Dodecahedron schlegel.svg|thumb|The polyhedral graph formed as the [[Schlegel diagram]] of a [[regular dodecahedron]].]] ...

{{Short description|Undirected graph with 11 nodes and 27 edges}} {{infobox graph ...

...irka Miller]], and Jozef Širáň, who first constructed them using [[voltage graph]]s in 1998.{{r|mms}} ...7. For all other degrees, the maximum number of vertices in a diameter-two graph must be smaller. ...

...ph connectivity]]. The input to the problem is a [[regular graph|2-regular graph]], forming either a single connected <math>n</math>-vertex cycle or two dis ...s computational model, including [[single-linkage clustering]]{{r|yv}} and geometric [[minimum spanning tree]]s.{{r|anoy}} However, proving the 1-vs-2 cycles co ...

...tain upper bounds for the number of [[perfect matching]]s in a [[bipartite graph]]. The permanent is therefore bounded by the product of the [[geometric mean]]s of the numbers from <math>1</math> to <math>r_i</math> for <math>i= ...

...ersen graph, unit distance.svg|thumb|170px|The dimension of the [[Petersen graph]] is 2.]] ...eger {{mvar|n}} such that there exists a "classical representation" of the graph in the [[Euclidean space]] of dimension {{mvar|n}} with all the edges havin ...

[[File:Greedy geometric spanner 2.svg|thumb|Greedy geometric spanner of 100 random points with stretch factor {{mvar|t}} = 2]] [[File:Greedy geometric spanner 1.1.svg|thumb|Greedy geometric spanner of the same points with stretch factor {{mvar|t}} = 1.1]] ...

...>f</math> and the identity <math>1_X</math>. The diagonal embedding is the graph morphism of <math>1_X</math>. ...ty or zero-dimensional. The difference between the topological and algebro-geometric context comes from the topological structure of the fiber product (in the c ...