On the super connectivity of Kronecker products of graphs
Hechao Wang, Erfang Shan
TL;DR
This paper investigates the super connectivity properties of the Kronecker product when combining a general graph with a complete graph, providing insights into its structural robustness.
Contribution
It establishes the super connectivity characteristics of the Kronecker product involving a general graph and a complete graph, a novel analysis in graph theory.
Findings
Super connectivity of Kronecker product with complete graphs determined
Structural robustness of the product analyzed
New theoretical results on graph connectivity presented
Abstract
In this paper we present the super connectivity of Kronecker product of a general graph and a complete graph.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Advanced Graph Theory Research · Graph Labeling and Dimension Problems