Issue Date | Title | Author(s) | Type | М-cat. |
2003 | A note on the smallest eigenvalue of fullerenes | Fowler, Patrick; Hansen, Pierre; Stevanović, Dragan ![](/image/organisations_icon_ico.png) | Article | |
2003 | Bounding the largest eigenvalue of trees in terms of the largest vertex degree | Stevanović, Dragan ![](/image/organisations_icon_ico.png) | Article | |
2003 | Remarks on graphs with majority of eigenvalues at most -1 | Stevanović, Dragan ![](/image/organisations_icon_ico.png) | Article | |
2003 | Hoffman-type identities | Dress, A; Stevanovic, D ![](/image/organisations_icon_ico.png) | Article | |
2002 | Constructing fullerene graphs from their eigenvalues and angles | Cvetković, Dragoš; Fowler, Patrick; Rowlinson, Peter; Stevanović, Dragan ![](/image/organisations_icon_ico.png) | Article | |
2002 | On the components of NEPS of connected bipartite graphs | Stevanović, Dragan ![](/image/organisations_icon_ico.png) | Article | |
2002 | Chemical applications of the Laplacian spectrum. VI. On the largest Laplacian eigenvalue of alkanes | Gutman, Ivan ; Vidović, Dušica; Stevanović, Dragan ![](/image/organisations_icon_ico.png) | Article | |
2001 | On the number of maximal independent sets of vertices in star-like ladders | Stevanović, Dragan ![](/image/organisations_icon_ico.png) | Article | |
2001 | Hosoya polynomial of composite graphs | Stevanović, Dragan ![](/image/organisations_icon_ico.png) | Article | |
2000 | When can the components of NEPS of connected bipartite graphs be almost cospectral? | Stevanović, Dragan ![](/image/organisations_icon_ico.png) | Article | |
1999 | When is NEPS of graphs connected? | Stevanović, Dragan ![](/image/organisations_icon_ico.png) | Article | |