Natural Science, Other, 2025
ON THE NUMBER OF VERTICES WITH AN INTERVAL SPECTRUM IN EDGE LABELING OF REGULAR GRAPHS
This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Submitted: 2025-02-12; Published: 2025-02-12
© 2025 by author(s) and The Gufo Inc.
This work is licensed under Creative Commons Attribution–NonCommercial International License
(CC BY-NC 4.0).
Abstract
Undirected simple finite graphs are considered. An upper bound of the number of vertices with an interval spectrum is obtained for any edge labeling of an arbitrary regular graph.