The adjacency graphs of a complex
A. K. Dewdney, Frank Harary (1976)
Czechoslovak Mathematical Journal
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
A. K. Dewdney, Frank Harary (1976)
Czechoslovak Mathematical Journal
Similarity:
Ľubomír Šoltés (1992)
Mathematica Slovaca
Similarity:
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...
Halina Bielak (1983)
Časopis pro pěstování matematiky
Similarity:
Bagga, Jay (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity: