A Description of the Subgraph Induced at a Labeling of a Graph by the Subset of Vertices with an Interval Spectrum
arXiv:1410.7927
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.