Distinguishing graphs of maximum valence 3

Hannah Schreiber, Svenja Hüning, Wilfried Imrich, Judith Kloas, Thomas Tucker

Research output: Contribution to journalArticleResearchpeer-review

Abstract

The distinguishing number D(G) of a graph G is the smallest number of colors that is needed to color G such that the only color preserving automorphism is the identity. We give a complete classification for all connected graphs G of maximum valence Δ(G)=3 and distinguishing number D(G)=3. As one of the consequences we get that all infinite connected graphs with Δ(G)=3 are 2-distinguishable.
Original languageEnglish
JournalElectronic Journal of Combinatorics
Publication statusSubmitted - 2017

Fingerprint

Color
Connected graph
Graph in graph theory
Infinite Graphs
Automorphism

Cite this

Schreiber, H., Hüning, S., Imrich, W., Kloas, J., & Tucker, T. (2017). Distinguishing graphs of maximum valence 3. Manuscript submitted for publication.

Distinguishing graphs of maximum valence 3. / Schreiber, Hannah; Hüning, Svenja; Imrich, Wilfried; Kloas, Judith; Tucker, Thomas.

In: Electronic Journal of Combinatorics, 2017.

Research output: Contribution to journalArticleResearchpeer-review

@article{acd4865a7b05459aa179f97549a828f2,
title = "Distinguishing graphs of maximum valence 3",
abstract = "The distinguishing number D(G) of a graph G is the smallest number of colors that is needed to color G such that the only color preserving automorphism is the identity. We give a complete classification for all connected graphs G of maximum valence Δ(G)=3 and distinguishing number D(G)=3. As one of the consequences we get that all infinite connected graphs with Δ(G)=3 are 2-distinguishable.",
author = "Hannah Schreiber and Svenja H{\"u}ning and Wilfried Imrich and Judith Kloas and Thomas Tucker",
year = "2017",
language = "English",
journal = "The electronic journal of combinatorics",
issn = "1077-8926",
publisher = "Electronic Journal of Combinatorics",

}

TY - JOUR

T1 - Distinguishing graphs of maximum valence 3

AU - Schreiber, Hannah

AU - Hüning, Svenja

AU - Imrich, Wilfried

AU - Kloas, Judith

AU - Tucker, Thomas

PY - 2017

Y1 - 2017

N2 - The distinguishing number D(G) of a graph G is the smallest number of colors that is needed to color G such that the only color preserving automorphism is the identity. We give a complete classification for all connected graphs G of maximum valence Δ(G)=3 and distinguishing number D(G)=3. As one of the consequences we get that all infinite connected graphs with Δ(G)=3 are 2-distinguishable.

AB - The distinguishing number D(G) of a graph G is the smallest number of colors that is needed to color G such that the only color preserving automorphism is the identity. We give a complete classification for all connected graphs G of maximum valence Δ(G)=3 and distinguishing number D(G)=3. As one of the consequences we get that all infinite connected graphs with Δ(G)=3 are 2-distinguishable.

M3 - Article

JO - The electronic journal of combinatorics

JF - The electronic journal of combinatorics

SN - 1077-8926

ER -