The distinguishing number and the distinguishing index of line and graphoidal graph(s)

DOI10.1016/j.akcej.2018.08.006zbMath1473.05259arXiv1708.05822OpenAlexW2962946956WikidataQ129310563 ScholiaQ129310563MaRDI QIDQ5154552

Saeid Alikhani, Samaneh Soltani

Publication date: 5 October 2021

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

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

zbMATH Keywords

distinguishing numberdistinguishing indexline and graphoidal graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (3)

Distinguishing number of hierarchical products of graphs ⋮ Asymmetric edge-colorings of graphs with three colors ⋮ Edge-determining sets and determining index

Cites Work

• Distinguishing graphs by edge-colourings
• The distinguishing chromatic number
• Graphoidal covers and graphoidal covering number of a graph
• Graph derivatives
• Graphoidal bipartite graphs
• Symmetry breaking in graphs
• Improving upper bounds for the distinguishing index
• Characterizations of derived graphs

This page was built for publication: The distinguishing number and the distinguishing index of line and graphoidal graph(s)