self-dual graph
Смотреть что такое "self-dual graph" в других словарях:
Dual graph — G′ is the dual graph of G In mathematics, the dual graph of a given planar graph G is a graph which has a vertex for each plane region of G, and an edge for each edge in G joining two neighboring regions, for a certain embedding of G. The term… … Wikipedia
self-dual — adjective a) (in projective geometry) of a proposition that is equivalent to its dual b) of a graph or polyhedron that is the dual of itself … Wiktionary
Dual polyhedron — The dual of a cube is an octahedron, shown here with vertices at the cube face centers … Wikipedia
Self-adjoint operator — In mathematics, on a finite dimensional inner product space, a self adjoint operator is one that is its own adjoint, or, equivalently, one whose matrix is Hermitian, where a Hermitian matrix is one which is equal to its own conjugate transpose.… … Wikipedia
Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… … Wikipedia
Nauru graph — The Nauru graph is Hamiltonian. Vertices 24 Edges 36 Radius 4 … Wikipedia
Möbius–Kantor graph — Named after August Ferdinand Möbius and S. Kantor Vertices 16 … Wikipedia
Wheel graph — infobox graph name = Wheel graph image caption = Several examples of wheel graphs vertices = n edges = 2( n − 1) chromatic number = 3 if n is odd 4 if n is even chromatic index = In the mathematical discipline of graph theory, a wheel graph W n… … Wikipedia
Paley graph — infobox graph name = Paley graph image caption = The Paley graph of order 13 namesake = Raymond Paley vertices = edges = chromatic number = chromatic index = properties = Strongly regularIn mathematics, and specifically graph theory, Paley graphs … Wikipedia
Petersen graph — Infobox graph name = Petersen graph image caption = The Petersen graph is most commonly drawn as a pentagon with a pentagram inside, with five spokes. namesake = Julius Petersen vertices = 10 edges = 15 radius = 2 diameter = 2 girth = 5 chromatic … Wikipedia
Median graph — The median of three vertices in a median graph In mathematics, and more specifically graph theory, a median graph is an undirected graph in which any three vertices a, b, and c have a unique median: a vertex m(a,b,c) that belongs to shortest… … Wikipedia
