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 Composition of graphs | Connectivity | NEPS of graphs | Number of components
- 1 Conjecture | Eigenvalues of graphs | Multiplicity of eigenvalues
- 1 Cospectral graphs | Characteristic polynomial | Multiple coalescences | Computational enumeration
- 1 Cospectral graphs | Graph complement | Walk-regular graph
- 1 Cube chain | directed graph | graphical solution of recurrence equation system | recurrence
- 1 degree sequence | greedy tree | Sombor index | trees
- 1 diagonalization | S. Cioaba | spectral radius | Starlike tree
- 1 Distance energy | Distance spectrum | Join | Regular graphs
- 1 Dynamic load balancing | Integral graphs | Unit size tokens
- 1 Energy of a graph | Equienergetic graphs | Product of graphs
- < previous 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.003 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.001 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š |