An improved upper bound for the domination number of a graph

DOI10.1007/S12044-025-00850-5MaRDI QIDQ6857802zbMATH OpenFDO

Authors S. Arumugam, S. M. Hegde, Shashanka Kulamarva

Publication date 16 February 2026

Published in Proceedings of the Indian Academy of Sciences. Mathematical Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S12044-025-00850-5

zbMATH Keywords

bound on dominationdomination in graphsdomination numberprivate neighbour

Mathematics Subject Classification ID

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

Cites work

• A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
• A survey of Nordhaus-Gaddum type relations
• Broadcast domination and multipacking in strongly chordal graphs
• Dominating sets in social network graphs
• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 3358515 (Why is no real title available?)
• On Complementary Graphs
• Vertex domination-critical graphs

This page was built for publication: An improved upper bound for the domination number of a graph

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