Some upper bounds for 2-domination number of graphs and a Graffiti.pc conjecture

MaRDI QIDQ3380752zbMATH OpenFDO

Authors Zhongwei Liu, Baoyindureng Wu

Publication date 29 September 2021

zbMATH Keywords

hypergraphstriangle-free graphssplit graphs2-domination number

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5919758
• A remark on the (2,2)-domination number
• Bounds on the \(k\)-domination number of a graph
• An upper bound on the domination number of a graph with minimum degree 2
• Bounds on the 2-domination number

Cited in

(4)

• A new lower bound for the total domination number in graphs proving a Graffiti.pc conjecture
• Proof of a conjecture on dominating sets inducing large component in graphs with minimum degree two
• A remark on the (2,2)-domination number
• scientific article; zbMATH DE number 5919758 (Why is no real title available?)

This page was built for publication: Some upper bounds for 2-domination number of graphs and a Graffiti.pc conjecture

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