Please use this identifier to cite or link to this item: http://10.9.150.37:8080/dspace//handle/atmiyauni/1989
Full metadata record
DC FieldValueLanguage
dc.contributor.authorVaidya, S. K.-
dc.contributor.authorParmar, A. D.-
dc.date.accessioned2024-11-25T05:31:47Z-
dc.date.available2024-11-25T05:31:47Z-
dc.date.issued2018-
dc.identifier.citationVaidya, S. K., & Parmar, A. D. (2018). On total domination and total equitable domination in graphs. Malaya Journal of Matematik, 6(02), 375-380.en_US
dc.identifier.urihttp://10.9.150.37:8080/dspace//handle/atmiyauni/1989-
dc.description.abstractThe bondage number of a nonempty graph is the minimum cardinality among all sets of edges for which. An equitable dominating set is called a total equitable dominating set if the induced subgraph has no isolated vertices. The total equitable domination number of is the minimum cardinality of a total equitable dominating set of. If and contains no isolated vertices then the total equitable bondage number of a graph is the minimum cardinality among all sets of edges for which. In the present work we prove some characterizations and investigate total equitable bondage number of Ladder and degree splitting of path.en_US
dc.language.isoenen_US
dc.publisherMalaya Journal of Matematiken_US
dc.subjectDominating seten_US
dc.subjectEquitable dominatingen_US
dc.subjectTotal dominating set;en_US
dc.subjectBondage number.en_US
dc.titleOn total domination and total equitable domination in graphsen_US
dc.typeArticleen_US
Appears in Collections:01. Journal Articles

Files in This Item:
File Description SizeFormat 
Some More Results on Total Equitable Bondage Number of A Graph.pdf317 kBAdobe PDFView/Open
Show simple item record


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