Dominating sets inducing large component in graphs with minimum degree two

DOI10.1007/S00373-023-02687-ZOpenAlexW4385809871MaRDI QIDQ6133670FDOQ6133670

Authors: Wei Yang, Baoyindureng Wu 

Publication date: 21 August 2023

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-023-02687-z

Recommendations

• Dominating sets inducing large components
• Proof of a conjecture on dominating sets inducing large component in graphs with minimum degree two
• 3-component domination numbers in graphs
• Domination in graphs with minimum degree two
• scientific article; zbMATH DE number 2192183

zbMATH Keywords

dominationtotal domination\(k\)-component domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)

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
• Domination in graphs of minimum degree at least two and large girth
• Dominating sets of maximal outerplanar graphs
• Domination in graphs with minimum degree two
• Total domination in maximal outerplanar graphs. II.
• Bounds related to domination in graphs with minimum degree two
• Dominating sets inducing large components
• Dominating sets inducing large components in maximal outerplanar graphs

Cited In (2)

• Proof of a conjecture on dominating sets inducing large component in graphs with minimum degree two
• 3-component domination numbers in graphs

This page was built for publication: 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 Q6133670)