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

zbMATH Open1488.05387MaRDI QIDQ3380752FDOQ3380752

Authors: Zhongwei Liu, Baoyindureng Wu 

Publication date: 29 September 2021

Recommendations

• scientific article
• 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

zbMATH Keywords

hypergraphstriangle-free graphssplit graphs2-domination number

Mathematics Subject Classification ID

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

Cited In (3)

• A new lower bound for the total domination number in graphs proving a Graffiti.pc conjecture
• A remark on the (2,2)-domination number
• Title not available (Why is that?)

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)