ON THE NUMBER OF VERTICES WITH AN INTERVAL SPECTRUM IN EDGE LABELING OF REGULAR GRAPHS
DOI:
https://doi.org/10.46991/PSYU:A/2014.48.3.040Keywords:
edge labeling, interval spectrum, regular graph, cubic graphAbstract
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.
Downloads
Published
2014-11-03
How to Cite
Davtyan, N., & Kamalian, R. (2014). ON THE NUMBER OF VERTICES WITH AN INTERVAL SPECTRUM IN EDGE LABELING OF REGULAR GRAPHS. Proceedings of the YSU A: Physical and Mathematical Sciences, 48(3 (235), 40–42. https://doi.org/10.46991/PSYU:A/2014.48.3.040
Issue
Section
Informatics
License
Copyright (c) 2014 Proceedings of the YSU
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.