Distinguishing number and distinguishing index of neighbourhood corona of two graphs

DOI10.11575/CDM.V14I1.62665zbMath1444.05051arXiv1606.03751OpenAlexW3117849724MaRDI QIDQ3299359

Samaneh Soltani, Saeid Alikhani

Publication date: 22 July 2020

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

zbMATH Keywords

distinguishing numberdistinguishing indexneighborhood corona

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Group actions on combinatorial structures (05E18)

Related Items (3)

Distinguishing orthogonality graphs ⋮ Distinguishing numbers and distinguishing indices of oriented graphs ⋮ Introduction to dominated edge chromatic number of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Distinguishing graphs by edge-colourings
• Cartesian powers of graphs can be distinguished by two labels
• Symmetry breaking in graphs
• Distinguishing colorings of Cartesian products of complete graphs
• On the corona of two graphs
• Spectra of the neighbourhood corona of two graphs
• Distinguishing number and distinguishing index of natural and fractional powers of graphs

This page was built for publication: Distinguishing number and distinguishing index of neighbourhood corona of two graphs