Distinguishing graphs of maximum valence 3 (Q2278113)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Distinguishing graphs of maximum valence 3 |
scientific article |
Statements
Distinguishing graphs of maximum valence 3 (English)
0 references
9 December 2019
0 references
Summary: The distinguishing number \(D(G)\) of a graph \(G\) is the smallest number of colors that is needed to color the vertices such that the only color-preserving automorphism fixes all vertices. We give a complete classification for all connected graphs \(G\) of maximum valence \(\Delta(G) = 3\) and distinguishing number \(D(G) = 3\). As one of the consequences we show that all infinite connected graphs with \(\Delta(G) = 3\) are \(2\)-distinguishable.
0 references
distinguishing number
0 references
\(2\)-distinguishable graphs
0 references
0 references