Information | |
---|---|
has gloss | eng: In the mathematical field of graph theory, the Tietzes graph is an undirected cubic graph with 12 vertices and 18 edges, formed by applying a Y-Δ transform to the Petersen graph and thereby replacing one of its vertices by a triangle. Tietzes graph has chromatic number 3, chromatic index 4, girth 3 and diameter 3. Its automorphism group has order 12, and is isomorphic to the dihedral group D6, the group of symmetries of an hexagon, including both rotations and reflections. |
lexicalization | eng: Tietze's Graph |
instance of | (noun) (computer science) the organization of data (and its storage allocations in a computer) data structure |
Meaning | |
---|---|
French | |
has gloss | fra: Le graphe de Tietze est, en théorie des graphes, un graphe 3-régulier possédant 12 sommets et 18 arêtes. |
lexicalization | fra: graphe de Tietze |
Media | |
---|---|
media:img | Tietze's graph.svg |
Lexvo © 2008-2024 Gerard de Melo. Contact Legal Information / Imprint