The nonsplit domination in subdivision graphs
Jemimal Chrislight, R.
Sunitha Mary, Y. Therese
A dominating set D of a graph G = (V, E) is a nonsplit dominating set if the induced subgraph ?V ? D? is connected. The nonsplit domination number ?ns(G) of G is the minimum cardinality of a nonsplit dominating set. An edge e = uv of a graph G is said to be subdivided if e is replaced by the edges uw and vw for some vertex w not in V (G). The graph obtained from G by subdividing each edge of G exactly once is called the subdivision graph of G and is denoted by S(G). In this paper, we study the nonsplit domination number of subdivision graph. We determine exact values of the nonsplit domination number of subdivision graph for some standard graphs. We also obtain bounds and relationship with other graph theoretic parameters for the ?ns(S(G)).
MetadataShow full item record
Showing items related by title, author, creator and subject.
Prioritizing the Relative Dominance of Drivers for Intellectual Entrepreneuring Through the Tertiary Knowledge Industry. Agwe, Jonathan N.; Sharif, Nawaz M.. Journal of Technology Management & Innovation; Vol. 2 No. 4 (2007); 20-43
Legislación laboral y organización productiva. jornada de trabajo y descanso dominical en chile: 1901 - 1925 Juan Carlos Yáñez Andrade; Universidad Mayor. Revista de Estudios Histórico-Jurídicos; N° 26 (2004)
Krishnakumari, B.; Venkatakrishnan, Y. B.. Proyecciones. Journal of Mathematics; Vol 35 No 3 (2016); 245-249