Upper bounds for the \(k\)-subdomination number of graphs
From MaRDI portal
Publication:1598803
DOI10.1016/S0012-365X(01)00311-9zbMath0990.05098MaRDI QIDQ1598803
Mao-cheng Cai, Li-ying Kang, Chuangyin Dang, Erfang Shan
Publication date: 28 May 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (3)
Lower bounds on the minus domination and \(k\)-subdomination numbers. ⋮ Dominating functions with integer values in graphs—a survey ⋮ Signed and Minus Dominating Functions in Graphs
This page was built for publication: Upper bounds for the \(k\)-subdomination number of graphs