On bounds and exact values of k-efficient domination number of a graph

DOI10.17777/PJMS2024.27.4.565MaRDI QIDQ6639239zbMATH OpenFDO

Authors N. Kavitha, Chandru Hegde, Kalachar Karthik

Publication date 15 November 2024

Published in Proceedings of the Jangjeon Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

Cartesian product of graphsefficient domination\(k\)-efficient partition

Mathematics Subject Classification ID

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

Recommendations

• \(k\)-efficient partitions of graphs
• Efficient (j,k)-domination
• k-Efficient domination: Algorithmic perspective
• Efficient \(k\)-distance dominating set in Cayley graphs
• Efficient bondage number of a graph

This page was built for publication: On bounds and exact values of \(k\)-efficient domination number of a graph

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