Power Bondage Number For Some Classes Of Graphs
Main Article Content
Abstract
The power bondage number is an essential specification of graphs which is standard upon the well-known power domination number. The power bondage number of a nonempty undirected graph is the least count of edges whose removal from the given graph . In this article we discuss about the power bondage number of some classes of graphs.
Downloads
Metrics
Article Details
Licensing
TURCOMAT publishes articles under the Creative Commons Attribution 4.0 International License (CC BY 4.0). This licensing allows for any use of the work, provided the original author(s) and source are credited, thereby facilitating the free exchange and use of research for the advancement of knowledge.
Detailed Licensing Terms
Attribution (BY): Users must give appropriate credit, provide a link to the license, and indicate if changes were made. Users may do so in any reasonable manner, but not in any way that suggests the licensor endorses them or their use.
No Additional Restrictions: Users may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.