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.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
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:
Slobodan K. Simić (1987)
Publications de l'Institut Mathématique
Similarity:
Barik, S., Nath, M., Pati, S., Sarma, B.K. (2008)
ELA. The Electronic Journal of Linear Algebra [electronic only]
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...
Zdzisław Skupień (2007)
Discussiones Mathematicae Graph Theory
Similarity:
Bretto, A. (1999)
Southwest Journal of Pure and Applied Mathematics [electronic only]
Similarity:
W. Wessel (1987)
Applicationes Mathematicae
Similarity: