Eigenvalue Conditions for Induced Subgraphs
Jochen Harant, Julia Niebling, Sebastian Richter (2015)
Discussiones Mathematicae Graph Theory
Similarity:
Necessary conditions for an undirected graph G to contain a graph H as induced subgraph involving the smallest ordinary or the largest normalized Laplacian eigenvalue of G are presented.