Trees with distinguishing index equal distinguishing number plus one

DOI10.7151/dmgt.2162zbMath1439.05075arXiv1608.03501OpenAlexW2964187151WikidataQ129108949 ScholiaQ129108949MaRDI QIDQ2175243

Sandi Klavžar, Florian Lehner, Saeid Alikhani, Samaneh Soltani

Publication date: 28 April 2020

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

automorphism groupunicyclic graphdistinguishing numberdistinguishing index

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Group actions on combinatorial structures (05E18)

Related Items (4)

An upper bound on the distinguishing index of graphs with minimum degree at least two ⋮ Extremal graphs for the distinguishing index ⋮ Equitable distinguishing chromatic number ⋮ On symmetries of edge and vertex colourings of graphs

Cites Work

• Distinguishing graphs by edge-colourings
• Distinguishing Cartesian products of countable graphs
• The list distinguishing number equals the distinguishing number for interval graphs
• Ein Ordnungsbegriff für Graphen ohne unendliche Wege mit einer Anwendung auf n-fach zusammenhaengende Graphen
• Bounding the distinguishing number of infinite graphs and permutation groups
• On symmetries of edge and vertex colourings of graphs
• On computing the distinguishing numbers of trees and forests
• The distinguishing chromatic number
• Distinguishability of locally finite trees
• Distinguishing labeling of group actions
• Symmetry breaking in graphs
• Graphs with large distinguishing chromatic number
• Bounds for distinguishing invariants of infinite graphs
• Distinguishing number of countable homogeneous relational structures
• Distinguishing graphs with intermediate growth
• Breaking graph symmetries by edge colourings
• The distinguishing number of the augmented cube and hypercube powers
• Distinguishing labellings of group action on vector spaces and graphs
• On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach
• A New Game Invariant of Graphs: the Game Distinguishing Number
• Distinguishing number and distinguishing index of natural and fractional powers of graphs
• THE DISTINGUISHING NUMBERS OF MERGED JOHNSON GRAPHS

This page was built for publication: Trees with distinguishing index equal distinguishing number plus one