Independent and vertex covering number on strong product of complete graphs

zbMATH Open1258.05090MaRDI QIDQ4904786FDOQ4904786

Authors: Chanasak Baitiang, Thanin Sitthiwirattham 

Publication date: 31 January 2013

Full work available at URL: http://www.ijpam.eu/contents/2012-81-3/10/index.html

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\)

zbMATH Keywords

strong 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)

Cited In (11)

• Independent and vertex covering number on Kronecker product of \(K_n\)
• Some Vertex-Graph Parameters on Modular Product of Graphs
• Vertex covering and independent number on difference graphs
• Title not available (Why is that?)
• On strong (weak) independent sets and vertex coverings of a graph
• The independence number of the strong product of cycles
• Matching and edge covering number on strong product of complete graphs
• Independent and vertex covering number on strong product of complete bipartite graphs
• The substantial independence number for the strong product of two graphs
• Title not available (Why is that?)
• Independent and vertex covering number on Kronecker product of \(C_n\)

Uses Software

• NISPOC

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)