Trees with distinguishing number two

DOI10.1016/J.AKCEJ.2018.02.001zbMATH Open1479.05051arXiv1611.09291OpenAlexW2963814438MaRDI QIDQ2176156FDOQ2176156

Authors: Saeid Alikhani, Samaneh Soltani 

Publication date: 4 May 2020

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Abstract: The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling with $d$ labels that is preserved only by a trivial automorphism. In this paper we characterize all trees with radius at most three and distinguishing number two. Also we present a necessary condition for trees with distinguishing number two and radius more than three.

Full work available at URL: https://arxiv.org/abs/1611.09291

Recommendations

• On computing the distinguishing numbers of trees and forests
• Symmetry breaking in graphs
• Trees with distinguishing index equal distinguishing number plus one
• Distinguishing Cartesian powers of graphs
• Using determining sets to distinguish Kneser graphs
• Distinguishing trees in linear time
• An upper bound on the distinguishing index of graphs with minimum degree at least two
• Distinguishing number and distinguishing index of join of two specific graphs
• Distinguishing and distinguishing chromatic numbers of generalized Petersen graphs
• The distinguishing chromatic number

zbMATH Keywords

treeradiusdistinguishing number

Mathematics Subject Classification ID

Trees (05C05)

Cites Work

• Symmetry breaking in graphs
• Title not available (Why is that?)
• The distinguishing number of Cartesian products of complete graphs
• On computing the distinguishing numbers of trees and forests
• Distinguishing Cartesian powers of graphs
• Locally geodesic cycles in 2-self-centered graphs
• A characterization for 2-self-centered graphs
• A study on center of a graph complement

Cited In (9)

• Trees with 2-reinforcement number three
• List distinguishing parameters of trees
• Distinguishability of locally finite trees
• Distinguishing trees in linear time
• Title not available (Why is that?)
• Introduction to dominated edge chromatic number of a graph
• On computing the distinguishing numbers of trees and forests
• Title not available (Why is that?)
• Trees with distinguishing index equal distinguishing number plus one

This page was built for publication: Trees with distinguishing number two

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2176156)