Journals Information
Universal Journal of Applied Mathematics Vol. 2(4), pp. 170 - 175
DOI: 10.13189/ujam.2014.020402
Reprint (PDF) (322Kb)
A Note on Domatic Subdivision Stable Graphs
M. Yamuna *, K. Karthika
School of Advanced Sciences, VIT University, Vellore, Tamilnadu, India
ABSTRACT
A domatic partition of a graph G = ( V, E ) is a partition of V into disjoint sets V1, V2, ..., VK such that each Vi is a dominating set for G. A subdivision of a graph G is a graph resulting from the subdivision of edges in G. In this paper we discuss about the minimal properties of domatic subdivision stable graph and we show that every graph is an induced subgraph of a domatic subdivision stable graph. We discuss methods of generating new domatic subdivision stable graphs from existing domatic subdivision stable graphs using graph operations.
KEYWORDS
Domatic Partition, Subdivision, Dominating Set, Minimal Set
Cite This Paper in IEEE or APA Citation Styles
(a). IEEE Format:
[1] M. Yamuna , K. Karthika , "A Note on Domatic Subdivision Stable Graphs," Universal Journal of Applied Mathematics, Vol. 2, No. 4, pp. 170 - 175, 2014. DOI: 10.13189/ujam.2014.020402.
(b). APA Format:
M. Yamuna , K. Karthika (2014). A Note on Domatic Subdivision Stable Graphs. Universal Journal of Applied Mathematics, 2(4), 170 - 175. DOI: 10.13189/ujam.2014.020402.