Please use this identifier to cite or link to this item: http://10.9.150.37:8080/dspace//handle/atmiyauni/1996
Title: Congruent Domination Number of Graphs Obtained by Means of Some Graph Operation
Authors: Jadeja, M. R.
Vadhel, H. D.
Parmar, A. D.
Keywords: Dominating Set
, Dominatio Numbner
Congruent Dominating Set
Congruent Domination Number
Issue Date: 2023
Publisher: Journal of Applied Science and Computations
Citation: M. R. Jadeja H. D. Vadhel, A. D. Parmar,Congruent Domination Number of Graphs Obtained by Means of Some Graph Operation,Journal of Applied Science and Computations Volume X, Issue VIII,August/2023 ISSN NO: 1076-5131 Page No: 62
Abstract: Abstract A dominating set is said to be a congruent dominating set of a graph if . The minimum cardinality of a minimal congruent dominating set of is called the congruent domination number of which is denoted by . In this paper, we investigate congruent domination number of some graphs obtained by means of some graph operation.
URI: http://10.9.150.37:8080/dspace//handle/atmiyauni/1996
Appears in Collections:01. Journal Articles

Files in This Item:
File Description SizeFormat 
Congruent Domination Number of Graphs Obtained.pdf562.63 kBAdobe PDFView/Open
Show full item record


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