Vertex vulnerability parameters of Kronecker products of complete graphs

DOI10.1016/j.ipl.2007.12.002zbMath1185.05093OpenAlexW1993942671MaRDI QIDQ963383

Aygul Mamut, Elkin Vumar

Publication date: 19 April 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.12.002

zbMATH Keywords

combinatorial problemsKronecker productcut setvertex vulnerability parameters

Mathematics Subject Classification ID

Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Related Items (23)

A note on the connectivity of direct products of graphs ⋮ Toughness of the corona of two graphs ⋮ Super connectivity of Kronecker product of complete bipartite graphs and complete graphs ⋮ Unnamed Item ⋮ On the edge connectivity of direct products with dense graphs ⋮ Wiener and vertex \(PI\) indices of Kronecker products of graphs ⋮ The Restricted Edge-Connectivity of Kronecker Product Graphs ⋮ Proof of a conjecture on connectivity of Kronecker product of graphs ⋮ On edge connectivity of direct products of graphs ⋮ On the super connectivity of Kronecker products of graphs ⋮ ISOLATED SCATTERING NUMBER OF SPLIT GRAPHS AND GRAPH PRODUCTS ⋮ Connectivity of Kronecker products with complete multipartite graphs ⋮ Connectivity of Kronecker products by \(K_2\) ⋮ Reciprocal degree distance of product graphs ⋮ SUPER EDGE CONNECTIVITY OF KRONECKER PRODUCTS OF GRAPHS ⋮ Harary index of product graphs ⋮ Further properties on the degree distance of graphs ⋮ On large (Δ, D, D, 1)-graphs ⋮ On some topological indices of the tensor products of graphs ⋮ Super connectivity of Kronecker products of graphs ⋮ A note on the connectivity of Kronecker products of graphs ⋮ Unnamed Item ⋮ CONNECTIVITY OF TENSOR PRODUCT OF GRAPHS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum cycle bases of direct products of complete graphs
• A survey of integrity
• On a class of posets and the corresponding comparability graphs
• Edge-integrity: A survey
• Imbeddings of the tensor product of graphs where the second factor is a complete graph
• On Hamilton cycle decompositions of the tensor product of complete graphs
• A finite automata approach to modeling the cross product of interconnection networks.
• Edge exchanges in Hamiltonian decompositions of Kronecker-product graphs
• Tough graphs and Hamiltonian circuits.
• Tenacity of complete graph products and grids
• Independent sets in tensor graph powers
• Edge‐tenacious networks
• Computing the Scattering Number of Graphs
• Hypercubes As Direct Products

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