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.
No institution available
Other
, 2025, Issue 1, pp. 1–10
ISSN Online: 0000-0000
DOI:
10.xxxx/example-doi