Some vertex vulnerability parameters of Kronecker products of complete graphs

MaRDI QIDQ3169596zbMATHFDO

Authors Hoji Marhaba, Vumar Elkin

Publication date 29 September 2011

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)

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

Cited in

(8)

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

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)