The distinguishing number (index) and the domination number of a graph
From MaRDI portal
Publication:4986551
zbMath1474.05295arXiv1707.06161MaRDI QIDQ4986551
Saeid Alikhani, Samaneh Soltani
Publication date: 27 April 2021
Full work available at URL: https://arxiv.org/abs/1707.06161
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Distinguishing graphs by edge-colourings
- The distinguishing chromatic number
- Graph derivatives
- The distinguishing number and distinguishing index of the lexicographic product of two graphs
- Symmetry breaking in graphs
- Distinguishing labellings of group action on vector spaces and graphs
- Improving upper bounds for the distinguishing index
This page was built for publication: The distinguishing number (index) and the domination number of a graph