SIGNED ROMAN DOMINATION NUMBER AND JOIN OF GRAPHS
From MaRDI portal
Publication:4956381
Abstract: In this paper we determine the signed Roman domination number of the join of cycles, wheels, fans and friendship graphs.
Cites work
- Defending the Roman Empire---a new strategy
- Graphs with large paired-domination number
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 3400923 (Why is no real title available?)
- Restricted domination parameters in graphs
- Signed domination in regular graphs and set-systems
- Signed Roman \(k\)-domination in trees
- Signed Roman domination in digraphs
- Signed Roman domination in graphs
- The signed Roman domatic number of a graph
Cited in
(5)- The signed Roman domination number of two classes graphs
- 2-rainbow domination number of the subdivision of graphs
- The signed (total) Roman domination problem on some classes of planar graphs -- convex polytopes
- Domination number and identifying code number of the subdivision graphs
- The signed Roman domination number of ladder graphs and their complements
This page was built for publication: SIGNED ROMAN DOMINATION NUMBER AND JOIN OF GRAPHS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4956381)