340
By M. Yamuna and K. Karthika
Keywords: domination, dot stable graphs.
A graph G is said to be domination dot stable ( DDS ) if ? ( G uv ) = ? ( G ), for all u, v ? V ( G ), u adjacent to v. In this paper we show that every graph is an induced subgraph of a DDS graph and we discuss few methods of generating new DDS graphs from existing DDS graphs using various graph operations.
The full paper PDF is not available online at the moment. Please try again later or
contact the editorial office.