Similarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph

DOI10.3233/FI-2017-1520zbMath1375.05200OpenAlexW2605296613WikidataQ57974180 ScholiaQ57974180MaRDI QIDQ4595596

Magdalena Lemańska, Rolando Trujillo-Rasua, Juan Alberto Rodríguez-Velázquez

Publication date: 5 December 2017

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

Full work available at URL: https://doi.org/10.3233/fi-2017-1520

zbMATH Keywords

weakly connected domination numbervertex cover number

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number

This page was built for publication: Similarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph