Induced subgraphs of product graphs and a generalization of Huang's theorem
Zhen-Mu Hong, Hong-Jian Lai, Jian-Bing Liu

TL;DR
This paper generalizes Huang's theorem on induced subgraphs with high maximum degree from hypercubes to Cartesian and semi-strong product graphs, using spectral properties of signed graphs.
Contribution
It introduces new signed product graphs and establishes bounds on maximum degree of induced subgraphs based on eigenvalues, extending Huang's result.
Findings
Induced subgraphs of product graphs have high maximum degree under certain spectral conditions.
Spectral symmetry conditions relate to the maximum degree bounds.
Provides necessary and sufficient conditions for spectral symmetry of the product graphs.
Abstract
Recently, Huang showed that every -vertex induced subgraph of the -dimensional hypercube has maximum degree at least in [Annals of Mathematics, 190 (2019), 949--955]. In this paper, we discuss the induced subgraphs of Cartesian product graphs and semi-strong product graphs to generalize Huang's result. Let be a connected signed bipartite graph of order and be a connected signed graph of order . By defining two kinds of signed product of and , denoted by and , we show that if and have exactly two distinct adjacency eigenvalues and respectively, then every -vertex induced subgraph of (resp. ) has…
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 · Interconnection Networks and Systems · Advanced Graph Theory Research
