2-DISTANCE VERTEX DISTINGUISHING INDEX OF SPARSE GRAPHS

DOI10.17654/0974165822035OpenAlexW4287147802MaRDI QIDQ5040850

Lomngam Kamga Victor, Ebodé Atangana Pie Désire

Publication date: 18 October 2022

Published in: Advances and Applications in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.17654/0974165822035

zbMATH Keywords

sparse graphsdischarging method2-distance vertex distinguishing edge coloring

Mathematics Subject Classification ID

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

Cites Work

• 2-distance vertex-distinguishing index of subcubic graphs
• Adjacent strong edge coloring of graphs
• Distant set distinguishing edge colourings of graphs
• Two-distance vertex-distinguishing index of sparse subcubic graphs
• Legally $$(\varDelta +2)$$ ( Δ + 2 ) -Coloring Bipartite Outerplanar Graphs in Cubic Time

This page was built for publication: 2-DISTANCE VERTEX DISTINGUISHING INDEX OF SPARSE GRAPHS