Proof of a conjecture on dominating sets inducing large component in graphs with minimum degree two

DOI10.1016/J.DISC.2024.114122zbMATH Open1543.05146MaRDI QIDQ6570044FDOQ6570044

Authors: Wei Yang, Baoyindureng Wu 

Publication date: 10 July 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

Recommendations

• Dominating sets inducing large component in graphs with minimum degree two
• Dominating sets inducing large components
• 3-component domination numbers in graphs
• A remark on the (2,2)-domination number
• Some upper bounds for 2-domination number of graphs and a Graffiti.pc conjecture

zbMATH Keywords

dominationtotal domination\(k\)-component domination

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Graph theory
• Title not available (Why is that?)
• Total domination in graphs
• Domination-balanced graphs
• Graphs with large total domination number
• Title not available (Why is that?)
• Total domination in graphs
• Dominating sets of maximal outerplanar graphs
• Domination in graphs with minimum degree two
• Domination versus total domination in claw-free cubic graphs
• Title not available (Why is that?)
• Total domination in maximal outerplanar graphs. II.
• Domination in digraphs and their direct and Cartesian products
• Graphs with unique minimum specified domination sets
• The domination number of plane triangulations
• Dominating sets inducing large components
• Dominating sets inducing large components in maximal outerplanar graphs

Cited In (2)

• 3-component domination numbers in graphs
• Dominating sets inducing large component in graphs with minimum degree two

This page was built for publication: Proof of a conjecture on dominating sets inducing large component in graphs with minimum degree two

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