The complementary product of two graphs
From MaRDI portal
Recommendations
Cited in
(48)- Spectra, signless Laplacian and Laplacian spectra of complementary prisms of graphs
- Rainbow disconnection in graphs
- On the geodetic number of complementary prisms
- Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs
- Identifying codes in the complementary prism of cycles
- Open-independent, open-locating-dominating sets in complementary prism graphs
- A note on the convexity number of the complementary prisms of trees
- Perfect matching cuts partitioning a graph into complementary subgraphs
- Cycles in complementary prisms
- \(k\)-tuple total restrained domination in complementary prisms
- Relating the annihilation number and the total domination number for some graphs
- Product Graphs Are Sum Graphs
- Recognizing some complementary products
- \(k\)-tuple total domination in complementary prisms
- Independent strong domination in complementary prisms
- Injective coloring of complementary prism and generalized complementary prism graphs
- On the General Position Number of Complementary Prisms
- A polynomial time algorithm for geodetic hull number for complementary prisms
- Complexity properties of complementary prisms
- k-tuple restrained domination in graphs
- Some cycle and star related Nordhaus-Gaddum type relations on strong efficient dominating sets
- Some results on the the \(b\)-chromatic number in complementary prism graphs
- Wiener indices of generalized complementary prisms
- Remarks on k-clique, k-independent set and 2-contamination in complementary prisms
- Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs
- Some results on the open locating-total domination number in graphs
- Partitioning a graph into complementary subgraphs
- The core of a complementary prism
- Differential in complementary prisms
- The core of a vertex-transitive complementary prism
- On the monophonic convexity in complementary prisms
- Global dominating broadcast in graphs
- Geometric and topological properties of the complementary prism networks
- The core of a vertex transitive complementary prism of a lexicographic product
- Independent transversal domination number in complementary prisms
- Partitioning the vertices of a graph or its complement into a total dominating set and an independent dominating set
- Unique response Roman domination versus 2-packing differential in complementary prisms
- Complexity results on \(k\)-independence in some graph products
- The automorphism group of a complementary prism
- Computing a 3-role assignment is polynomial-time solvable on complementary prisms
- Minimum 2-percolating sets in 2-connected, diameter 2 graphs
- On the zero forcing number of complementary prism graphs
- Eccentric connectivity index in complementary prisms
- 2-rainbow independent domination in complementary prisms
- On the perfect differential and perfect Roman domination in complementary prisms
- Perfect matching cuts partitioning a graph into complementary subgraphs
- On the bondage, strong and weak bondage numbers in complementary prism graphs
- Domination and total domination in complementary prisms
This page was built for publication: The complementary product of two graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5441572)
