Domination in Graphs

DOI10.1007/978-0-8176-4789-6_4zbMath1221.05256OpenAlexW14266457MaRDI QIDQ3064396

Michael D. Plummer, Nawarat Ananchuen, Watcharaphong Ananchuen

Publication date: 21 December 2010

Published in: Structural Analysis of Complex Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-0-8176-4789-6_4

zbMATH Keywords

matchingdominationtotal dominationconnected dominationvertex criticaledge critical

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) 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)

Well-dominated graphs without cycles of lengths 4 and 5 ⋮ The domination number of exchanged hypercubes ⋮ Unnamed Item

This page was built for publication: Domination in Graphs