ON THE NUMBER OF VERTICES WITH AN INTERVAL SPECTRUM IN EDGE LABELING OF REGULAR GRAPHS

Authors

  • N.N. Davtyan Chair of Programming and Information Technologies of Ijevan Branch of the YSU, Armenia
  • R.R Kamalian Chair of Programming and Information Technologies of Ijevan Branch of the YSU, Armenia, The Institute for Informatics and Automation Problems of NAS RA

DOI:

https://doi.org/10.46991/PYSUA.2014.48.3.040

Keywords:

edge labeling, interval spectrum, regular graph, cubic graph

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.

Downloads

Published

2014-11-03

Issue

Vol. 48 No. 3 (235) (2014)

Section

Informatics

License

Copyright (c) 2014 Proceedings of the YSU

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

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/PYSUA.2014.48.3.040
Crossref
Scopus
Google Scholar
Europe PMC