IJPAM: Volume 87, No. 3 (2013)
SAS, VIT University
Vellore, Tamilnadu, INDIA
Abstract. For a given non-adjacent pair in a graph , we denote by the graph obtained by deleting and and adding a new vertex adjacent to precisely those vertices of which were adjacent to at least one of or in . We say that is obtained by contracting on . In this paper we introduce -stable graphs and we have established that -stable trees have a unique structure.
Received: June 30, 2013
AMS Subject Classification: 05C69
Key Words and Phrases: domination, -stable
Download paper from here.
DOI: 10.12732/ijpam.v87i3.9 How to cite this paper?
Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395