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

Davtyan Davtyan

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.

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.

Author(s)

Table of Contents

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

Abstract

Author(s)

Table of Contents

Related Articles

CONSISTENCY DEPENDENT NATURE OF SLIDING DEFORMATION IN SWELLING SOILS

ON SYMMETRIC SUBALGEBRAS IN BANACH ALGEBRA

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

Abstract

Subscribe to TheGufo Newsletter​

Subscribe to TheGufo Newsletter