- Article
Characterization of the Minimizing Graph of the Connected Graphs Whose Complements Are Bicyclic
- Muhammad Javaid
In a certain class of graphs, a graph is called minimizing if the least eigenvalue of its adjacency matrix attains the minimum. A connected graph containing two or three cycles is called a bicyclic graph if its number of edges is equal to its number...

