Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/1186
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSumathi P-
dc.contributor.authorBrindha T-
dc.date.accessioned2020-08-28T05:26:00Z-
dc.date.available2020-08-28T05:26:00Z-
dc.date.issued2016-01-
dc.identifier.issn2347-4890-
dc.identifier.urihttps://ijournals.in/wp-content/uploads/2017/06/12.4117-Brindha.compressed.pdf-
dc.identifier.urihttp://localhost:8080/xmlui/handle/123456789/1186-
dc.description.abstractLet G=(V,E) be a simple, undirected, finite nontrivial graph. A non empty set SV of vertices in a graph G is called a dominating set if every vertex in V-S is adjacent to some vertex in S. The domination number γ(G) of G is the minimum cardinality of a dominating set of G.A dominating set S is called a non split set dominating set if there exists a non empty set R S such that is connected for every set TV-S and the induced subgraph is connected. The minimum cardinality of a nonsplit set dominating set is called the non split set domination number of G and is denoted by γnss (G). In this paper, bounds for γnss (G) and exact values for some particular classes of graphs are found. Keywords: Dominating Number, Non Split domination numberen_US
dc.language.isoenen_US
dc.publisherInternational Journal of Software & Hardware Research in Engineeringen_US
dc.subjectDominating Numberen_US
dc.subjectNon Split domination numberen_US
dc.titleA NOTE ON NON-SPLIT SET DOMINATIONen_US
dc.typeArticleen_US
Appears in Collections:International Journals

Files in This Item:
File Description SizeFormat 
A NOTE ON NON-SPLIT SET DOMINATION.docx10.31 kBMicrosoft Word XMLView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.