Harant, Jochen GND; Niebling, Julia GND; Richter, Sebastian
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.
10.7151/dmgt.1790 copy citation link
DOI (10.7151/dmgt.1790)
https://doi.org/10.7151/dmgt.1790
Use and reproduction: