Abstract
The sets of vertices and edges of an undirected, simple, finite, connected graph are denoted by and , respectively. An arbitrary nonempty finite subset of consecutive integers is called an interval. An injective mapping is called a labeling of the graph . If is a graph, is its arbitrary vertex, and is its arbitrary labeling, then the set \} is called a spectrum of the vertex of the graph at its labeling . For any graph and its arbitrary labeling , a structure of the subgraph of , induced by the subset of vertices of with an interval spectrum, is described.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.