Line Graphs with Exactly two Positive Eigenvalues
Bojana Borovićanin (2002)
Publications de l'Institut Mathématique
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Bojana Borovićanin (2002)
Publications de l'Institut Mathématique
Similarity:
Dragoš Cvetković (1982)
Publications de l'Institut Mathématique
Similarity:
J. J. Seidel (1989)
Banach Center Publications
Similarity:
Slobodan K. Simić (1995)
Publications de l'Institut Mathématique
Similarity:
Dragoš Cvetković, Dragan Stevanović (2003)
Publications de l'Institut Mathématique
Similarity:
P. Rowlinson (2004)
Publications de l'Institut Mathématique
Similarity:
Yi Wang, Yi-Zheng Fan, Xiao-Xin Li, Fei-Fei Zhang (2015)
Discussiones Mathematicae Graph Theory
Similarity:
A graph in a certain graph class is called minimizing if the least eigenvalue of its adjacency matrix attains the minimum among all graphs in that class. Bell et al. have identified a subclass within the connected graphs of order n and size m in which minimizing graphs belong (the complements of such graphs are either disconnected or contain a clique of size n/2 ). In this paper we discuss the minimizing graphs of a special class of graphs of order n whose complements are connected and...
Mirko Lepović (1991)
Publications de l'Institut Mathématique
Similarity:
Simić, Slobodan K. (1989)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity: