Differential in complementary prisms
From MaRDI portal
Recommendations
Cites work
- Bounds on the differential of a graph
- Combinatorics for smaller kernels: the differential of a graph
- Computing the differential of a graph: hardness, approximability and exact algorithms
- Differential in Cartesian product graphs.
- Differential in infrastructure networks
- Differentials in certain classes of graphs
- Differentials in graphs
- Graph theory with applications
- scientific article; zbMATH DE number 2131198 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 194437 (Why is no real title available?)
- Lower bounds on the differential of a graph
- On the corona of two graphs
- On the differential and Roman domination number of a graph with minimum degree two
- On the differential in graphs
- Relations between the differential and parameters in graphs
- The complementary product of two graphs
- The differential and the roman domination number of a graph
- The differential of the strong product graphs
Cited in
(5)- Prismatic Dieudonné Theory
- The core of a complementary prism
- Unique response Roman domination versus 2-packing differential in complementary prisms
- On the perfect differential and perfect Roman domination in complementary prisms
- Roman domination parameters with respect to differentials in probabilistic neural networks
This page was built for publication: Differential in complementary prisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6089069)