Vertex vulnerability parameters of Kronecker products of complete multipartite graphs and complete graphs

MaRDI QIDQ4900812zbMATH OpenFDO

Authors Dan Tang, Hechao Wang, Erfang Shan

Publication date 24 January 2013

zbMATH Keywords

complete graphcut setKronecker productvertex vulnerability parameter

Mathematics Subject Classification ID

Connectivity (05C40) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Some vertex vulnerability parameters of Kronecker products of complete graphs
• Vertex vulnerability parameters of Kronecker products of complete graphs
• Vulnerability parameters of tensor product of complete equipartite graphs
• Connectivity of Kronecker products with complete multipartite graphs
• Super connectivity of Kronecker products with complete multipartite graphs.

Cited in

(4)

• Vulnerability parameters of tensor product of complete equipartite graphs
• Diamond product of two common complete bipartite graphs
• Some vertex vulnerability parameters of Kronecker products of complete graphs
• Vertex vulnerability parameters of Kronecker products of complete graphs

This page was built for publication: Vertex vulnerability parameters of Kronecker products of complete multipartite graphs and complete graphs

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