Abstract
AbstractRecently, Huang showed that every ‐vertex induced subgraph of the ‐dimensional hypercube has maximum degree at least . In this paper, we discuss the induced subgraphs of Cartesian product graphs and semistrong 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 is symmetric with respect to 0, from which we obtain more general results on maximum degree of the induced subgraphs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
