Paired- and induced paired-domination in (E,net)-free graphs

DOI10.7151/dmgt.1617zbMath1257.05122OpenAlexW1982740198MaRDI QIDQ4648781

Oliver Schaudt

Publication date: 16 November 2012

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1617

zbMATH Keywords

dominationinduced matchingspaired-domination\(\{E, net\}\)-free graphsinduced paired-domination

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 (3)

Paired Domination in Graphs ⋮ Perfectly relating the domination, total domination, and paired domination numbers of a graph ⋮ Upper paired domination versus upper domination

This page was built for publication: Paired- and induced paired-domination in (E,net)-free graphs