Diamond graph

Uses your system voice; voice and rate in settings.

Snapshot

≈ 2 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In the mathematical field of graph theory, the diamond graph is a planar, undirected graph with 4 vertices and 5 edges. It consists of a complete graph minus one edge. The diamond graph has radius 1, diameter 2, girth 3, chromatic number 3 and chromatic index 3. It is also a 2-vertex-connected and a 2-edge-connected, graceful, Hamiltonian graph.

In the mathematical field of graph theory, the diamond graph is a planar, undirected graph with 4 vertices and 5 edges. It consists of a complete graph minus one edge. The diamond graph has radius 1, diameter 2, girth 3, chromatic number 3 and chromatic index 3. It is also a 2-vertex-connected and a 2-edge-connected, graceful, Hamiltonian graph.

Diamond-free graphs and forbidden minor

A graph is diamond-free if it has no diamond as an induced subgraph. The triangle-free graphs are diamond-free graphs, since every diamond contains a triangle. The diamond-free graphs are locally clustered: that is, they are the graphs in which every neighborhood is a cluster graph. Alternatively, a graph is diamond-free if and only if every pair of maximal cliques in the graph shares at most one vertex. The family of graphs in which each connected component is a cactus graph is downwardly closed under graph minor operations. This graph family may be characterized by a single forbidden minor. This minor is the diamond graph. If both the butterfly graph and the diamond graph are forbidden minors, the family of graphs obtained is the family of pseudoforests.

Algebraic properties

The full automorphism group of the diamond graph is a group of order 4 isomorphic to the Klein four-group, the direct product of the cyclic group with itself. The characteristic polynomial of the diamond graph is . It is the only graph with this characteristic polynomial, making it a graph determined by its spectrum.

See also

Vámos matroid

Text derived from https://en.wikipedia.org/w/index.php?oldid=1095081667 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001095081667 · captured 1656219645.0 · version history

Cite this page as: encyclopegia.org, “Diamond graph”, snapshot enwiki-001095081667. https://encyclopegia.org/a/diamond-graph

Sources cited in this revision

2 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.