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 Zitier-Link kopieren
DOI (10.7151/dmgt.1790)
https://doi.org/10.7151/dmgt.1790
Nutzung und Vervielfältigung: