A Study on The Gamma Graph of Cycle C3K+1

Iassc, Rakhimol; Bhatt, Krupali

dc.contributor.author	Iassc, Rakhimol
dc.contributor.author	Bhatt, Krupali
dc.date.accessioned	2025-01-01T10:17:17Z
dc.date.available	2025-01-01T10:17:17Z
dc.date.issued	2023
dc.identifier.citation	Iassc, Rakhimol & Bhatt, Krupali (2023). A Study on The Gamma Graph of Cycle C3K+1. Journal of Computational Mathematica, vii(ii), 102-106.	en_US
dc.identifier.issn	2456-8686
dc.identifier.uri	http://10.9.150.37:8080/dspace//handle/atmiyauni/2182
dc.description.abstract	For a graph G = (V, E), a set S ⊆ V is a dominating set if every vertex in V − S is adjacent to at least one vertex in S. The domination number γ(G) of G equals the minimum cardinality of a dominating set in G. A dominating set is aγ -set in G if \|S = γ(G)\|. A gamma graph γ.G of a garph G is a graph with S as a vertex set, if S1 S2 are adjacent if there exist two vertices u and v of G suchthat. In this paper we initiate the study of gamma graph of cycle C3k+1	en_US
dc.language.iso	en	en_US
dc.publisher	Journal of Computational Mathematica	en_US
dc.relation.ispartofseries	;vii(ii), 102-106
dc.subject	Dominating Set	en_US
dc.subject	Gamma Set	en_US
dc.subject	Gamma Graph	en_US
dc.title	A Study on The Gamma Graph of Cycle C3K+1	en_US
dc.type	Article	en_US