An upper bound on the distinguishing index of graphs with minimum degree at least two

zbMath1463.05244arXiv1702.03524MaRDI QIDQ4969593

Samaneh Soltani, Saeid Alikhani

Publication date: 13 October 2020

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

zbMATH Keywords

upper bounddistinguishing indexedge-colourings

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

The distinguishing index of connected graphs without pendant edges

Cites Work

• Unnamed Item
• Unnamed Item
• Distinguishing graphs by edge-colourings
• Symmetry breaking in graphs
• Trees with distinguishing index equal distinguishing number plus one
• The distinguishing number of Cartesian products of complete graphs
• Distinguishing colorings of Cartesian products of complete graphs
• Improving upper bounds for the distinguishing index
• Distinguishing number and distinguishing index of certain graphs

This page was built for publication: An upper bound on the distinguishing index of graphs with minimum degree at least two