The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
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.
Torgašev, Aleksandar (1992)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Kinkar Ch. Das (2005)
Kragujevac Journal of Mathematics
Similarity:
Chen, Yanqing, Wang, Ligong (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dragoš Cvetković, Peter Rowlinson, Slobodan Simić (2007)
Publications de l'Institut Mathématique
Similarity:
Jianfeng Wang, Haixing Zhao, Qiongxiang Huang (2012)
Czechoslovak Mathematical Journal
Similarity:
A multicone graph is defined to be the join of a clique and a regular graph. Based on Zhou and Cho's result [B. Zhou, H. H. Cho, Remarks on spectral radius and Laplacian eigenvalues of a graph, Czech. Math. J. 55 (130) (2005), 781–790], the spectral characterization of multicone graphs is investigated. Particularly, we determine a necessary and sufficient condition for two multicone graphs to be cospectral graphs and investigate the structures of graphs cospectral to a multicone graph....
Gurusamy Rengasamy Vijayakumar (2013)
Discussiones Mathematicae Graph Theory
Similarity:
The infimum of the least eigenvalues of all finite induced subgraphs of an infinite graph is defined to be its least eigenvalue. In [P.J. Cameron, J.M. Goethals, J.J. Seidel and E.E. Shult, Line graphs, root systems, and elliptic geometry, J. Algebra 43 (1976) 305-327], the class of all finite graphs whose least eigenvalues ≥ −2 has been classified: (1) If a (finite) graph is connected and its least eigenvalue is at least −2, then either it is a generalized line graph or it is represented...