1. DSpace at ATMIYA UNIVERSITY
  2. 02. Faculty of Science
  3. 02. Department of Chemistry
  4. 00. Faculty Publications
  5. 01. Journal Articles
Please use this identifier to cite or link to this item: http://10.9.150.37:8080/dspace//handle/atmiyauni/1846
Full metadata record
DC FieldValueLanguage
dc.contributor.authorS. K., Vaidya-
dc.contributor.authorAjani, P. D.-
dc.date.accessioned2024-11-21T06:56:57Z-
dc.date.available2024-11-21T06:56:57Z-
dc.date.issued2021-
dc.identifier.citationVaidya, S. K., & Ajani, P. D. (2021). Restrained Edge Domination Number of Some Path Related Graphs. J Sci Res, 13(1), 145-151.en_US
dc.identifier.urihttp://10.9.150.37:8080/dspace//handle/atmiyauni/1846-
dc.description.abstractFor a graph, a set is a restrained dominating (restrained edge dominating) set if every vertex (edge) not in S is adjacent (incident) to a vertex (edge) in S and to a vertex (edge) in The minimum cardinality of a restrained dominating (restrained edge dominating) set of G is called restrained domination (restrained edge domination) number of G, denoted by The restrained edge domination number of some standard graphs are already investigated while in this paper the restrained edge domination number like degree splitting, switching, square and middle graph obtained from path.en_US
dc.language.isoenen_US
dc.publisherJOURNAL OF SCIENTIFIC RESEARCHen_US
dc.subjectDominating seten_US
dc.subjectRestrained dominating seten_US
dc.subjectRestrained edge dominating seten_US
dc.subjectRestrained edge domination number.en_US
dc.titleRestrained Edge Domination Number of Some Path Related Graphsen_US
dc.typeArticleen_US
Appears in Collections:01. Journal Articles

Files in This Item:
File Description SizeFormat 
Restrained Edge Domination Number of Some Path Related Graphs.pdf303.7 kBAdobe PDFView/Open
Show simple item record


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