Vertex‐Distinguishing and Sum‐Distinguishing Edge Coloring of Regular Graphs
Journal of Graph Theory · 2026-09 · 113 (1) · 73-87
DOI: 10.1002/jgt.70049 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Graph Theory, online erschienen am 25.04.2026. Verfasst von Yuping Gao und 2 weiteren Autor:innen. Die Arbeit nennt 18 Literaturangaben. Gefördert von: Directorate for Biological Sciences, Fundamental Research Funds for the Central Universities, Division of Computing and Communication Foundations.
Abstract (Originalsprache)
Given an integer , an edge‐‐coloring of a graph is an assignment of colors to the edges of such that no two adjacent edges receive the same color. A vertex‐distinguishing (resp. sum‐distinguishing) edge‐‐coloring of is an edge‐‐coloring such that for any two distinct vertices and , the set (resp. sum) of colors taken from all the edges incident with is different from that taken from all the edges incident with . The vertex‐distinguishing chromatic index (resp. sum‐distinguishing chromatic index), denoted (resp. ), is the smallest value such that has a vertex‐distinguishing edge‐‐coloring (resp. sum‐distinguishing edge‐‐coloring). Let be a ‐regular graph on vertices, where is even and sufficiently large. We show that if is arbitrarily close to from above, and if . Our first result strengthens a result of Balister et al. for such class of regular graphs, and our second result constitutes a significant advancement in the field of sum‐distinguishing edge coloring. To achieve these results, we introduce novel edge coloring results which may be of independent interest.
Förderung
- Directorate for Biological Sciences
- Fundamental Research Funds for the Central Universities
- Division of Computing and Communication Foundations
Zitieren
APA
Gao, Y., Shan, S., & Wang, G. (2026). Vertex‐Distinguishing and Sum‐Distinguishing Edge Coloring of Regular Graphs. Journal of Graph Theory, 113(1), 73-87. https://doi.org/10.1002/jgt.70049
Vancouver
Gao Y, Shan S, Wang G. Vertex‐Distinguishing and Sum‐Distinguishing Edge Coloring of Regular Graphs. Journal of Graph Theory. 2026;113(1):73-87. doi:10.1002/jgt.70049
BibTeX
@article{Gao2026,
author = {Gao, Yuping and Shan, Songling and Wang, Guanghui},
title = {Vertex‐Distinguishing and Sum‐Distinguishing Edge Coloring of Regular Graphs},
journal = {Journal of Graph Theory},
year = {2026},
volume = {113},
number = {1},
pages = {73--87},
doi = {10.1002/jgt.70049}
}
EUVIMED