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.
oai:noad.sci.am:135847
Proceedings of the Yerevan State University, Physical and Mathematical Sciences
nndavtyan@gmail.com ; rrkamalian@yahoo.com
Chair of Programming and Information Technologies of Ijevan Branchof the YSU ; Institute for Informatics and Automation Problems
Mar 3, 2021
Jul 21, 2020
6
https://noad.sci.am/publication/149391
Edition name | Date |
---|---|
N. N. DAVTYAN, ON THE NUMBER OF VERTICES WITH AN INTERVAL SPECTRUMIN EDGE LABELING OF REGULAR GRAPHS | Mar 3, 2021 |
Davtyan Narine Kamalian Rafayel Ruben
Davtyan Narine Khachatryan Arpine Kamalian Rafayel