Show simple item record

The nonsplit domination in subdivision graphs

dc.creatorJemimal Chrislight, R.
dc.creatorSunitha Mary, Y. Therese
dc.date2020-10-01
dc.date.accessioned2020-10-16T12:44:49Z
dc.date.available2020-10-16T12:44:49Z
dc.identifierhttps://www.revistaproyecciones.cl/index.php/proyecciones/article/view/3085
dc.identifier10.22199/issn.0717-6279-2020-05-0068
dc.identifier.urihttps://revistaschilenas.uchile.cl/handle/2250/155185
dc.descriptionA 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)).en-US
dc.formatapplication/pdf
dc.languageeng
dc.publisherUniversidad Católica del Norte.en-US
dc.relationhttps://www.revistaproyecciones.cl/index.php/proyecciones/article/view/3085/3541
dc.rightsCopyright (c) 2020 R. Jemimal Chrislight, Y. Therese Sunitha Maryen-US
dc.rightshttp://creativecommons.org/licenses/by/4.0en-US
dc.sourceProyecciones (Antofagasta, On line); Vol. 39 No. 5 (2020); 1113-1120en-US
dc.sourceProyecciones. Revista de Matemática; Vol. 39 Núm. 5 (2020); 1113-1120es-ES
dc.source0717-6279
dc.source10.22199/issn.0717-6279-2020-05
dc.subjectDomination numberen-US
dc.subjectNonsplit domination numberen-US
dc.subjectSubdivision graphen-US
dc.subjectNonsplit domination number of subdivision graphen-US
dc.subject05C69en-US
dc.subjectVertex subsets with special properties (dominating sets, independent sets, cliques, etc.)en-US
dc.titleThe nonsplit domination in subdivision graphsen-US
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion
dc.typePeer-reviewed Articleen-US
dc.typetexten-US


This item appears in the following Collection(s)

Show simple item record