MATCHING PROPERTIES IN DOUBLE DOMINATION EDGE CRITICAL GRAPHS

DOI10.1142/S1793830910000541MaRDI QIDQ3575371zbMATH OpenFDO

Authors Haichao Wang, Liying Kang

Publication date 27 July 2010

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S1793830910000541

zbMATH Keywords

double domination edge critical graphsfactor-criticalmatching

Mathematics Subject Classification ID

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

Recommendations

• Matching properties in connected domination critical graphs
• Matching properties in total domination vertex critical graphs
• Matching properties in domination critical graphs.
• Perfect matchings in paired domination vertex critical graphs
• Properties of total domination edge-critical graphs
• Edge double-critical graphs
• scientific article; zbMATH DE number 1843906
• Perfect matchings in total domination critical graphs
• Matching criticality in intersecting hypergraphs
• Connected domination: vertex criticality and matchings

Cites work

• 3-factor-criticality in domination critical graphs
• \(k\)-tuple domination in graphs
• A generalised upper bound for the k-tuple domination number
• Factor-critical property in 3-dominating-critical graphs
• Graph theory with applications
• Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
• Matching properties in connected domination critical graphs
• Matching properties in domination critical graphs.
• Matchings in 3-vertex-critical graphs: the odd case
• Matchings in 3‐vertex‐critical graphs: The even case
• New bounds on the \(k\)-domination number and the \(k\)-tuple domination number
• Nordhaus-Gaddum inequalities for domination in graphs
• Proof of a conjecture on \(k\)-tuple domination in graphs
• Some matching properties in \(4-\gamma_{\times 2}\)-critical graphs
• The k-tuple domination number revisited
• The \(k\)-tuple twin domination in de Bruijn and Kautz digraphs
• The upper bound on \(k\)-tuple domination numbers of graphs

Cited in

(6)

• Hamiltonicities of double domination critical and stable claw-free graphs
• Matching properties in connected domination critical graphs
• 3-factor-criticality in double domination edge critical graphs
• Double domination edge removal critical graphs
• Perfect matchings in total domination critical graphs
• Matching properties in total domination vertex critical graphs

This page was built for publication: MATCHING PROPERTIES IN DOUBLE DOMINATION EDGE CRITICAL GRAPHS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3575371)