The chromatic distinguishing index of certain graphs

DOI10.1016/J.AKCEJ.2019.03.008zbMATH Open1473.05081arXiv1712.03649OpenAlexW2963029879WikidataQ128198376 ScholiaQ128198376MaRDI QIDQ5154569FDOQ5154569

Authors: Saeid Alikhani, Samaneh Soltani 

Publication date: 5 October 2021

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

Abstract: The distinguishing index of a graph $G$, denoted by $D^{\prime }(G)$, is the least number of labels in an edge labeling of $G$ not preserved by any non-trivial automorphism. The distinguishing chromatic index $chi{\text{'}}_D(G)$ of a graph $G$ is the least number $d$ such that $G$ has a proper edge labeling with $d$ labels that is preserved only by the identity automorphism of $G$. In this paper we compute the distinguishing chromatic index for some specific graphs. Also we study the distinguishing chromatic index of corona product and join of two graphs.

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

Recommendations

• Distinguishing number and distinguishing index of certain graphs
• Distinguishing graphs by edge-colourings
• Distinguishing number and distinguishing index of join of two specific graphs
• Distinguishing index of graphs with simple automorphism groups
• Extremal graphs for the distinguishing index

zbMATH Keywords

edge coloringschromatic indexdistinguishing index

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Graph derivatives
• Symmetry breaking in graphs
• Title not available (Why is that?)
• The distinguishing number of Cartesian products of complete graphs
• The distinguishing chromatic number
• Distinguishing graphs by edge-colourings
• Distinguishing colorings of Cartesian products of complete graphs
• The distinguishing index of the Cartesian product of finite graphs
• Improving upper bounds for the distinguishing index
• Distinguishing number and distinguishing index of natural and fractional powers of graphs

Cited In (24)

• Distinguishing number and distinguishing index of strong product of two graphs
• A generalization of chromatic index
• Distinguishing number and distinguishing index of neighbourhood corona of two graphs
• On the chromatic index of path decompositions
• Distinguishing index of graphs with simple automorphism groups
• Title not available (Why is that?)
• Title not available (Why is that?)
• Distinguishing numbers and distinguishing indices of oriented graphs
• Distinguishing number and distinguishing index of certain graphs
• Precise bounds for the distinguishing index of the Cartesian product
• The chromatic index of a graph whose core is a cycle of order at most 13
• The distinguishing chromatic number of line graphs of complete graphs
• Edge-determining sets and determining index
• The distinguishing chromatic number of bipartite graphs of girth at least six
• Distinguishing number and distinguishing index of join of two specific graphs
• Distinguishing graphs by edge-colourings
• Chromatic index of simple hypergraphs
• Edge-distinguishing index of a graph
• The distinguishing number and distinguishing index of the lexicographic product of two graphs
• Upper bounds on vertex distinguishing chromatic indices of some Halin graphs
• The distinguishing number and the distinguishing index of graphs from primary subgraphs
• Title not available (Why is that?)
• The distinguishing index of the Cartesian product of finite graphs
• Trees with distinguishing index equal distinguishing number plus one

This page was built for publication: The chromatic distinguishing index of certain graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5154569)