On Combining the Methods of Link Residual and Domination in Networks
From MaRDI portal
Publication:5134288
DOI10.3233/FI-2020-1930zbMath1471.68211OpenAlexW3024725568MaRDI QIDQ5134288
Publication date: 16 November 2020
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2020-1930
domination numbernetwork design and communicationgraph vulnerabilityaverage lower residual domination numberlink-residual closenessresidual domination number
Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)
Related Items (4)
On the bondage, strong and weak bondage numbers in complementary prism graphs ⋮ On agglomeration-based rupture degree in networks and a heuristic algorithm ⋮ On the average lower bondage number of graphs under join and corona operations ⋮ Analysis of Vulnerability of Some Transformation Networks
This page was built for publication: On Combining the Methods of Link Residual and Domination in Networks