Private domination number of a graph

DOI10.1080/09720529.2007.10698147MaRDI QIDQ3545836zbMATH OpenOpenAlexFDO

Authors B. Jaya Prasad, T. Tamizh Chelvam, S. Robinson Chellathurai

Publication date 11 December 2008

Published in Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09720529.2007.10698147

zbMATH Keywords

independence numberprivate domination number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• scientific article; zbMATH DE number 5138367
• Upper secure domination number of a graph
• scientific article; zbMATH DE number 975414
• On equality in an upper bound for domination parameters of graphs
• Perfect secure domination in graphs

Cites work

• scientific article; zbMATH DE number 1055145 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• Graph-theoretic parameters concerning domination, independence, and irredundance

Cited in

(2)

• scientific article; zbMATH DE number 5138367 (Why is no real title available?)
• scientific article; zbMATH DE number 975414 (Why is no real title available?)

This page was built for publication: Private domination number of a graph

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