The chromatic distinguishing index of certain graphs

DOI10.1016/J.AKCEJ.2019.03.008MaRDI QIDQ5154569zbMATH OpenOpenAlexWikidataFDO

Authors Saeid Alikhani, Samaneh Soltani

Publication date 5 October 2021

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

edge coloringschromatic indexdistinguishing index

Mathematics Subject Classification ID

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

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.

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

Cites work

• scientific article; zbMATH DE number 3428958 (Why is no real title available?)
• Distinguishing colorings of Cartesian products of complete graphs
• Distinguishing graphs by edge-colourings
• Distinguishing number and distinguishing index of natural and fractional powers of graphs
• Graph derivatives
• Improving upper bounds for the distinguishing index
• Symmetry breaking in graphs
• The distinguishing chromatic number
• The distinguishing index of the Cartesian product of finite graphs
• The distinguishing number of Cartesian products of complete graphs

Cited in

(24)

• Trees with distinguishing index equal distinguishing number plus one
• Distinguishing number and distinguishing index of strong product of two graphs
• A generalization of chromatic index
• On the chromatic index of path decompositions
• Distinguishing number and distinguishing index of neighbourhood corona of two graphs
• Distinguishing index of graphs with simple automorphism groups
• scientific article; zbMATH DE number 4208096 (Why is no real title available?)
• scientific article; zbMATH DE number 25879 (Why is no real title available?)
• Distinguishing numbers and distinguishing indices of oriented graphs
• Distinguishing number and distinguishing index of certain graphs
• The chromatic index of a graph whose core is a cycle of order at most 13
• Precise bounds for the distinguishing index of the Cartesian product
• 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
• scientific article; zbMATH DE number 4214033 (Why is no real title available?)
• The distinguishing number and the distinguishing index of graphs from primary subgraphs
• The distinguishing index of the Cartesian product of finite graphs

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)