Please use this identifier to cite or link to this item: http://10.9.150.37:8080/dspace//handle/atmiyauni/1905
Full metadata record
DC FieldValueLanguage
dc.contributor.authorJadeja, M. R.-
dc.contributor.authorVadhel, H. D.-
dc.contributor.authorParmar, A. D.-
dc.date.accessioned2024-11-22T05:59:41Z-
dc.date.available2024-11-22T05:59:41Z-
dc.date.issued2023-
dc.identifier.citationM. R. Jadej, 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: 62en_US
dc.identifier.issn1076-5131-
dc.identifier.urihttp://10.9.150.37:8080/dspace//handle/atmiyauni/1905-
dc.description.abstractA 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.en_US
dc.language.isoenen_US
dc.publisherJournal of Applied Science and Computationsen_US
dc.subjectDominating Seten_US
dc.subjectDominatio Numbneren_US
dc.subjectCongruent Dominating Seten_US
dc.subjectCongruent Domination Numberen_US
dc.titleCongruent Domination Number of Graphs Obtained by Means of Some Graph Operationen_US
dc.typeArticleen_US
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 simple item record


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