Independent and vertex covering number on strong product of complete graphs
From MaRDI portal
Publication:4904786
Recommendations
- Independent and vertex covering number on strong product of complete bipartite graphs
- Matching and edge covering number on strong product of complete graphs
- Independent and vertex covering number on Kronecker product of \(K_{m,n}\)
- Independent and vertex covering number on Kronecker product of \(K_n\)
- Independent and vertex covering number on Kronecker product of \(P_n\)
Cited in
(11)- On strong (weak) independent sets and vertex coverings of a graph
- Some Vertex-Graph Parameters on Modular Product of Graphs
- Vertex covering and independent number on difference graphs
- scientific article; zbMATH DE number 3758388 (Why is no real title available?)
- The substantial independence number for the strong product of two graphs
- Independent and vertex covering number on Kronecker product of \(C_n\)
- The independence number of the strong product of cycles
- Independent and vertex covering number on strong product of complete bipartite graphs
- scientific article; zbMATH DE number 6133149 (Why is no real title available?)
- Independent and vertex covering number on Kronecker product of \(K_n\)
- Matching and edge covering number on strong product of complete graphs
This page was built for publication: Independent and vertex covering number on strong product of complete graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4904786)