Weak Roman bondage number of a graph
From MaRDI portal
Publication:779190
DOI10.1007/978-3-030-39219-2_13zbMATH Open1456.05126OpenAlexW3002563777MaRDI QIDQ779190FDOQ779190
Authors: P. Roushini Leely Pushpam, N. Srilakshmi
Publication date: 21 July 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-39219-2_13
Recommendations
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cited In (8)
- Quasi-total Roman bondage number in graphs
- Weak Roman domination stable graphs upon edge-addition
- Title not available (Why is that?)
- Some results of weak Roman domination number in graphs
- Roman \(\{2\}\)-bondage number of a graph
- Weak Roman subdivision number of graphs
- Weakly connected Roman domination in graphs
- Roman bondage numbers of some graphs
This page was built for publication: Weak Roman bondage number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q779190)