A Description of the Subgraph Induced at a Labeling of a Graph by the Subset of Vertices with an Interval Spectrum

preprint2014arXivOpen access

Abstract

The sets of vertices and edges of an undirected, simple, finite, connected graph GG are denoted by V(G)V(G) and E(G)E(G), respectively. An arbitrary nonempty finite subset of consecutive integers is called an interval. An injective mapping φ:E(G)→{1,2,...,∣E(G)∣}φ:E(G)\rightarrow \{1,2,...,|E(G)|\} is called a labeling of the graph GG. If GG is a graph, xx is its arbitrary vertex, and φφ is its arbitrary labeling, then the set SG(x,φ)≡{φ(e)/e∈E(G),eis incident withxS_G(x,φ)\equiv\{φ(e)/ e\in E(G), e \textrm{is incident with} x\} is called a spectrum of the vertex xx of the graph GG at its labeling φφ. For any graph GG and its arbitrary labeling φφ, a structure of the subgraph of GG, induced by the subset of vertices of GG with an interval spectrum, is described.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.