A NOTE ON NON-SPLIT SET DOMINATION

Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/1186

Full metadata record

DC Field	Value	Language
dc.contributor.author	Sumathi P	-
dc.contributor.author	Brindha T	-
dc.date.accessioned	2020-08-28T05:26:00Z	-
dc.date.available	2020-08-28T05:26:00Z	-
dc.date.issued	2016-01	-
dc.identifier.issn	2347-4890	-
dc.identifier.uri	https://ijournals.in/wp-content/uploads/2017/06/12.4117-Brindha.compressed.pdf	-
dc.identifier.uri	http://localhost:8080/xmlui/handle/123456789/1186	-
dc.description.abstract	Let 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 number	en_US
dc.language.iso	en	en_US
dc.publisher	International Journal of Software & Hardware Research in Engineering	en_US
dc.subject	Dominating Number	en_US
dc.subject	Non Split domination number	en_US
dc.title	A NOTE ON NON-SPLIT SET DOMINATION	en_US
dc.type	Article	en_US
Appears in Collections:	International Journals

Files in This Item:

File	Description	Size	Format
A NOTE ON NON-SPLIT SET DOMINATION.docx		10.31 kB	Microsoft Word XML	View/Open