Independent and vertex covering number on Kronecker product of C_n

MaRDI QIDQ2879549zbMATH OpenFDO

Authors Thanin Sitthiwirattham, Jarunee Soontharanon

Publication date 27 March 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-71-1/12/index.html

zbMATH Keywords

Kronecker productindependent numbervertex covering number

Mathematics Subject Classification ID

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)

Recommendations

• Independent and vertex covering number on Kronecker product of \(K_n\)
• Independent and vertex covering number on Kronecker product of \(P_n\)
• Independent and vertex covering number on Kronecker product of \(K_{m,n}\)
• Independent and vertex covering number on Kronecker product of \(W_n\)
• Independent and vertex covering number on strong product of complete graphs
• Independent and vertex covering number on strong product of complete bipartite graphs
• scientific article; zbMATH DE number 6133149
• Independence number of products of Kneser graphs
• The \(k\)-independence number of graph products
• scientific article; zbMATH DE number 718579

Cited in

(11)

• 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 \(W_n\)
• Matching number and edge covering number on Kronecker product of \(C_n\)
• Domination on Kronecker product of \(C_n\)
• scientific article; zbMATH DE number 6133149 (Why is no real title available?)
• 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 strong product of complete bipartite graphs
• Matching number and edge covering number on Kronecker product of \(P_n\)
• Independent and vertex covering number on Kronecker product of \(P_n\)

This page was built for publication: Independent and vertex covering number on Kronecker product of \(C_n\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2879549)