Edge-locating coloring of graphs

DOI10.5614/EJGTA.2024.12.1.6MaRDI QIDQ6571562zbMATH OpenFDO

Authors M. Korivand, Doost Ali Mojdeh, E. T. Baskoro, A. Erfanian

Publication date 12 July 2024

Published in Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.5614/EJGTA.2024.12.1.6

zbMATH Keywords

distinguishing chromatic indexedge-locating coloringjoin graphsmatching

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• On ( k , ℓ )-locating colorings of graphs
• The locating chromatic number of the join of graphs
• Neighbor-locating colorings in graphs
• scientific article; zbMATH DE number 1869706
• Characterizing all trees with locating-chromatic number 3

Cites work

• Asymmetric trees with two prescribed degrees
• Characterizing all trees with locating-chromatic number 3
• Chromatic graph theory
• Destroying automorphisms by fixing nodes
• Distinguishing arc-colourings of symmetric digraphs
• Distinguishing graphs by edge-colourings
• Distinguishing threshold of graphs
• Edge metric dimension of graphs.
• Graph theory
• Graphs of order \(n\) with locating-chromatic number \(n-1\)
• scientific article; zbMATH DE number 3494441 (Why is no real title available?)
• scientific article; zbMATH DE number 3544092 (Why is no real title available?)
• scientific article; zbMATH DE number 1869706 (Why is no real title available?)
• Identifying graph automorphisms using determining sets
• On the comparison of the distinguishing coloring and the locating coloring of graphs
• On the conjectures of neighbor locating coloring of graphs
• On the determining number and the metric dimension of graphs
• On the locating chromatic number of the Cartesian product of graphs.
• Symmetry breaking in graphs
• The determining number of a Cartesian product
• The determining number of Kneser graphs
• The difference between the metric dimension and the determining number of a graph
• The distinguishing chromatic number
• The full automorphism groups, determining sets and resolving sets of coprime graphs
• The locating chromatic number for m-shadow of a connected graph
• Uniquely identifying the edges of a graph: the edge metric dimension

Cited in

(3)

• Neighbor locating coloring on graphs: three products
• On two conjectures regarding the neighbor-locating chromatic number
• Uniquely proper distinguishing colorable graphs

This page was built for publication: Edge-locating coloring of graphs

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