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 maximum degree at least (resp. ). Moreover, we discuss the eigenvalues of and and obtain a sufficient and necessary condition such that the spectrum of and are symmetric, from which we obtain more general results on maximum degree of the induced subgraphs.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.