On a Problem Concerning k-Subdomination Numbers of Graphs

DOI10.1023/B:CMAJ.0000024508.43606.9AMaRDI QIDQ3366594zbMATH OpenFDO

Authors Bohdan Zelinka

Publication date 14 February 2006

Published in Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/30804

zbMATH Keywords

\(k\)-subdomination number of a graphthree-dimensional cube graph

Mathematics Subject Classification ID

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

Recommendations

• Upper bounds for the \(k\)-subdomination number of graphs
• Minus k-subdomination in graphs. II
• Disproof of a conjecture on the subdivision domination number of a graph
• k-subdomination in graphs
• A counterexample to conjecture of Barefoot, Harary, and Jones

Cited in

(4)

• Upper bounds for the \(k\)-subdomination number of graphs
• k-subdomination in graphs
• Signed and minus dominating functions in graphs
• scientific article; zbMATH DE number 4089585 (Why is no real title available?)

This page was built for publication: On a Problem Concerning k-Subdomination Numbers of Graphs

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