Please use this identifier to cite or link to this item: http://10.9.150.37:8080/dspace//handle/atmiyauni/2182
Title: A Study on The Gamma Graph of Cycle C3K+1
Authors: Iassc, Rakhimol
Bhatt, Krupali
Keywords: Dominating Set
Gamma Set
Gamma Graph
Issue Date: 2023
Publisher: Journal of Computational Mathematica
Citation: Iassc, Rakhimol & Bhatt, Krupali (2023). A Study on The Gamma Graph of Cycle C3K+1. Journal of Computational Mathematica, vii(ii), 102-106.
Series/Report no.: ;vii(ii), 102-106
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
URI: http://10.9.150.37:8080/dspace//handle/atmiyauni/2182
ISSN: 2456-8686
Appears in Collections:01. Journal Articles

Files in This Item:
File Description SizeFormat 
A Study on The Gamma Graph of Cycle C3K+1.pdf421.41 kBAdobe PDFView/Open
Show full item record


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