Strong domatic number of a graph

DOI10.1142/S179383092450126XMaRDI QIDQ6900226zbMATH OpenFDO

Authors N. Ghanbari, Saeid Alikhani

Publication date 13 November 2025

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S179383092450126X

zbMATH Keywords

cubicstrong domatic numberstrong domination number

Mathematics Subject Classification ID

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

Cites work

• A note on a relation between the weak and strong domination numbers of a graph
• A survey of selected recent results on total domination in graphs
• Bounds on the strong domination number
• Characterization of graphs using domination polynomials
• Domination in generalized Petersen graphs
• Domination polynomials of cubic graphs of order 10
• scientific article; zbMATH DE number 3815677 (Why is no real title available?)
• scientific article; zbMATH DE number 3739597 (Why is no real title available?)
• scientific article; zbMATH DE number 4127268 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 7671000 (Why is no real title available?)
• Independent domination in graphs: A survey and recent results
• On the total domatic number of regular graphs
• Strong domination number of some operations on a graph
• Strong weak domination and domination balance in a graph
• Total domination in graphs
• Total domination in graphs
• Towards a theory of domination in graphs

Cited in

(1)

• Certain variants of domatic partitions of n-inordinate invariant intersection graphs

This page was built for publication: Strong domatic number of a graph

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