Combining the Concepts of Residual and Domination in Graphs

DOI10.3233/FI-2019-1806zbMath1415.05139OpenAlexW2940874334WikidataQ127995608 ScholiaQ127995608MaRDI QIDQ5223204

Aysun Aytaç, Tufan Turaci

Publication date: 17 July 2019

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2019-1806

zbMATH Keywords

domination numbernetwork design and communicationgraph vulnerabilityaverage lower residual domination numberresidual domination number

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

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: Combining the Concepts of Residual and Domination in Graphs