Some vertex vulnerability parameters of Kronecker products of complete graphs

zbMATH Open1240.05230MaRDI QIDQ3169596FDOQ3169596

Authors: Hoji Marhaba, Vumar Elkin 

Publication date: 29 September 2011

Recommendations

• Vertex vulnerability parameters of Kronecker products of complete graphs
• Vertex vulnerability parameters of Kronecker products of complete multipartite graphs and complete graphs
• Vulnerability parameters of tensor product of complete equipartite graphs
• Super connectivity of Kronecker products of some graphs.
• scientific article; zbMATH DE number 6902630

zbMATH Keywords

Kronecker productcut setvertex vulnerability parameter

Mathematics Subject Classification ID

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

Cited In (8)

• Vertex vulnerability parameters of Kronecker products of complete multipartite graphs and complete graphs
• Vertex vulnerability parameters of Kronecker products of complete graphs
• A note on the toughness and edge-toughness of Kronecker product of graphs
• Diamond product of two common complete bipartite graphs
• On Kronecker product of two \(RL\)-graphs and some related results
• Signed domination in Kronecker product of two complete graphs
• Vulnerability parameters of tensor product of complete equipartite graphs
• Determinants in the Kronecker product of matrices: the incidence matrix of a complete graph

This page was built for publication: Some vertex vulnerability parameters of Kronecker products of complete graphs

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