Independent and vertex covering number on Kronecker product of P_n
zbMATH Open1243.05207MaRDI QIDQ2893014FDOQ2893014
Publication date: 25 June 2012
Published in: International Journal of Pure and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.ijpam.eu/contents/2011-73-2/8/index.html
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)
Cited In (6)
- Independent and vertex covering number on Kronecker product of \(K_n\)
- Matching number and edge covering number on Kronecker product of \(C_n\)
- Title not available (Why is that?)
- Maximum independent sets in direct products of cycles or trees with arbitrary graphs
- Smallest independent dominating sets in Kronecker products of cycles
- Independent and vertex covering number on Kronecker product of \(C_n\)
This page was built for publication: Independent and vertex covering number on Kronecker product of \(P_n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2893014)