Stevanović, Dragan
Loading...
3
0
20
0
false
Full Name
Stevanović, Dragan
ORCID
Scopus Author ID
Country
Serbia
Loading...
2
0
20
0
false
Subject
- 1 05C07 | 05C99 | Asymmetric graph | Number of triangles | Regular graph
- 1 05C25 | 05C50 | dicyclic groups | dihedral groups | Distance powers | integral Cayley graph
- 1 Adjacency matrices | Bipartite graph | Core | Extremal graph theory
- 1 Adjacency matrix | AutoGraphiX | Conjectures | Extremal graph | Graph | Index | Irregularity | Largest eigenvalue | Spectral spread | Variable neighborhood search
- 1 Adjacency matrix | Clique number | Kite graph | Largest eigenvalue | Spectral radius
- 1 Adjacency matrix | Decomposition | Digraph | Eigenvalues
- 1 Adjacency matrix | Domination-critical graphs | Extremal graphs | Spectral radius
- 1 Adjacency matrix | Eigenvector | Wilf's problem
- 1 Adjacency matrix | Laplacian matrix | Largest eigenvalue | Tree
- 1 Adjacency matrix | Lower bounds | Spectral radius | Upper bounds
- next >
Date issued
- 29 2020 - 2026
- 51 2010 - 2019
- 41 2000 - 2009
- 1 1990 - 1999
Type
- 122 Article
Results 121-122 of 122 (Search time: 0.001 seconds).
| Author(s) | Title | Issue Date | Appears in | Rank | |
|---|---|---|---|---|---|
| 121 | Stevanović, Dragan | When can the components of NEPS of connected bipartite graphs be almost cospectral? | 15-May-2000 | Linear Algebra and Its Applications; 311(1-3); 35-44 | M22 |
| 122 | Stevanović, Dragan | When is NEPS of graphs connected? | 1-Nov-1999 | Linear Algebra and Its Applications; 301(1-3); 137-144 | M22 |
Projects
(Co-Investigators)
Results 1-2 of 2 (Search time: 0.0 seconds).
| Acronym | Title | Start date | Completion | P-Investigator |
|---|---|---|---|---|
| PROJECT 174033 | Graph theory and mathematical programming with applications in chemistry and computer science | 01-01-2011 | 31-12-2019 | Davidović, Tatjana |
| PROJECT 1389 | Graph theory and mathematical programming with applications in chemistry and transportation | 01-01-2002 | 31-12-2005 | Cvetković, Dragoš |