Dragan Stevanović

dragance106@yahoo.com

CV

SOFTWARE

smallGRAPHS, a system for processing and calculating on graph catalogues

newGRAPH, a system for visualization and interactive modification of graphs and automatic recalculation of graph invariants

I am Acquisition Editor in the book publishing program in mathematics http://www.versita.com/Book_Author/Mathematics/ launched jointly by de Gruyter and Versita. The program is focused on authors affiliated in countries of the region of Central and Eastern Europe (including Greece, Turkey and the region of former Yugoslavia). If you have a proposal for a research monograph or graduate level textbook in Graph Theory or Combinatorics, feel free to contact me.

As easy as riding a bicycle.

PAPERS

Submitted

• D. Stevanović, M. Milošević, A spectral proof of the uniqueness of strongly regular with parameters (81, 20, 1, 6), submitted to European Journal of Combinatorics
• A. Ilić, D. Stevanović, Constructions of Hamiltonian graphs with bounded degree and diameter O (log n), submitted to Discrete Mathematics and Theoretical Computer Science
• D. Stevanović, Laplacian-like energy of trees, submitted to MATCH Commun. Math. Comput. Chem.
• P. Hansen, D. Stevanović, M. Aouchiche, Variable Neighborhood Search for Extremal Graphs. 17. Further Conjectures and Results about the Index, submitted to Discussiones Mathematicae—Graph Theory

Accepted

• D. Stevanović, M. Petković, M. Bašić, On the Diameter of Circulant Integral Graphs, accepted for publication in Ars Combinatoria
• M. Aouchiche, F.K. Bell, D. Cvetković, P. Hansen, P. Rowlinson, S. Simić, D. Stevanović, Variable Neighborhood Search for Extremal Graphs, 11. Some Conjectures Related to the Largest Eigenvalue of a Graph, accepted for publication in European Journal of Operational Research 7
• D. Stevanović, I. Stanković, R51a.2006 M. Milošević, More on the Relation between Energy and Laplacian Energy of Graphs, accepted for publication in MATCH Commun. Math. Comput. Chem.
  
  

2008

52. D. Stevanović, Maximizing Wiener index of graphs with fixed maximum degree, MATCH Commun. Math. Comput. Chem. 60 (2008), 71–83

51. D. Stevanović, M. Aouchiche, P. Hansen, On the spectral radius of graphs with a given domination number, Linear Algebra Appl. 428 (2008), 1854–1864

50. P. Hansen, D. Stevanović, On Bags and Bugs, Discrete Appl. Math. 156 (2008), 986–997, extended abstract appears as Electronic Notes in Discrete Mathematics 19 (2005), 111–116

49. D. Stevanović, P. Hansen, The minimum spectral radius of graphs with a given clique number, Electron. J. Linear Algebra 17 (2008), 110–117
    
    

2007

48. D. Stevanović, N.M.M. de Abreu, M.A.A. de Freitas, R. Del-Vecchio, Walks and Regular Integral Graphs, Linear Algebra Appl. 423 (2007), 119–135

47. D. Stevanović, Research Problems from the Aveiro Workshop on Graph Spectra, Linear Algebra Appl. 423 (2007), 172–181
    
    

2006

46. V. Brankov, P. Hansen, D. Stevanović, Automated upper bounds on the largest Laplacian eigenvalue, Linear Algebra Appl. 414 (2006), 407–424

45. B. Zhou, D. Stevanović, A Note on Zagreb Indices, MATCH Commun. Math. Comput. Chem. 56 (2006), 571–578

44. V. Brankov, D. Cvetković, S. Simić, D. Stevanović, Simultaneous editing and multilabelling of graphs in system newGRAPH, Univ. Beograd. Publ. Elektr. Fak, Ser. Mat. 17 (2006), 112–121 8

43. D. Stevanović, V. Brankov, Some trees characterized by eigenvalues and angles, Publ. Inst. Math. (Belgrade) 79(93) (2006), 19–27
    
    

2005

42. D. Stevanović, Energy and NEPS of graphs, Linear Multilinear Algebra 53 (2005), 67–74

41. D. Stevanović, I. Stanković, Remarks on hyperenergetic circulant graphs, Linear Algebra Appl. 400 (2005), 345–348

40. S. Grunewald, D. Stevanović, Semiharmonic bicyclic graphs, Appl. Math. Letters 18 (2005), 1228–1238

39. D. Stevanović, All graphs in which each pair of distinct vertices has exactly two common neighbours, Math. Bohemica 130 (2005), 101–105
    
    

2004

38. D. Cvetković, D. Stevanović, Spectral moments of fullerene graphs, MATCH Commun. Math. Comput. Chem. 50 (2004), 62–72

37. J. Koolen, V. Moulton, D. Stevanović, The structure of spherical graphs, European J. Comb. 25 (2004), 299–310

36. D. Stevanović, The largest eigenvalue of nonregular graphs, J. Combin. Theory, Ser. B 91 (2004), 143–146

35. D. Stevanović, Distance regularity of compositions of graphs, Appl. Math. Letters 17 (2004), 337–343

34. D. Stevanović, Bipartite density of cubic graphs: case of equality, Discrete Math. 283 (2004), 279–281

33. V. Brankov, D. Stevanović, I. Gutman, Equienergetic chemical trees, J. Serb. Chem. Soc. 69 (2004), 549–554

32. I. Gutman, D. Stevanović, S. Radenković, S. Milosavljević, N. Smiljanović, Dependence of Total -Electron Energy on Large Number of Non-Bonding Molecular Orbitals, J. Serb. Chem. Soc. 69 (2004), 777– 782 9

31. A. Dress, S. Grunewald, D. Stevanović, Semiharmonic graphs with fixed cyclomatic number, Appl. Math. Letters 17 (2004), 623–629

30. A. Dress, D. Stevanović, A Note on a Theorem of Horst Sachs, Ann. Combinatorics 8 (2004), 487–497

29. D. Stevanović, Note on a question of Karimi, Lewinter and Stauffer, Graph Theory Notes of New York 46 (2004), 43–44

28. D. Stevanović, Maximal planar biregular graphs, Graph Theory Notes of New York 46 (2004), 45–48

27. D. Stevanović, A Note on a Conjecture due to Gutman, Graph Theory Notes of New York 47 (2004), 25–26
    
    

2003

26. P. Fowler, P. Hansen, D. Stevanović, A Note on the Smallest Eigenvalue of Fullerenes, MATCH Commun. Math. Chem. 48 (2003), 37–48

25. D. Stevanović, Bounding the largest eigenvalue of trees in terms of the largest vertex degree, Linear Algebra Appl. 360 (2003), 35–42

24. D. Stevanović, Remarks on graphs with majority of eigenvalues at most −1, Linear Algebra Appl. 367 (2003), 337–340

23. A. Dress, D. Stevanović, Hoffman-type identities, Appl. Math. Letters 16 (2003), 297–302

22. D. Cvetković, D. Stevanović, Graphs with the smallest eigenvalue at least −p3, Publ. Inst. Math. (Belgrade) 73 (87) (2003), 39–51

21. S. Simić, D. Stevanović, Two new and shorter proofs in graph theory, Univ. Beograd. Publ. Elektr. Fak, Ser. Mat. 14 (2003), 94–98

20. D. Stevanović, 4-Regular integral graphs avoiding ±3 in the spectrum, Univ. Beograd. Publ. Elektr. Fak, Ser. Mat. 14 (2003), 99–110

19. D. Stevanović, V. Brankov, An Invitation to newGRAPH, Rendiconti del Seminario Matematico di Messina, Serie II, Tomo XXV, Volume 9 (2003), 211–216
    
    

2002

18. I. Gutman, D. Vidović, D. Stevanović, Chemical applications of the Laplacian spectrum. VI. On the largest Laplacian eigenvalue of alkanes, J. Serb. Chem. Soc. 67 (2002), No.6, 407–413

17. D. Cvetković, P. Rowlinson, P. Fowler, D. Stevanović, Constructing fullerene graphs from their eigenvalues and angles, Linear Algebra Appl. 356 (2002), 37–56

16. D. Stevanović, On the components of NEPS of connected bipartite graphs, Linear Algebra Appl. 356 (2002), 67–78

15. K. Balinska, D. Cvetković, Z. Radosavljević, S. Simić, D. Stevanović, A survey on integral graphs, Univ. Beograd. Publ. Elektr. Fak, Ser. Mat. 13 (2002), 42–65

14. P. Hansen, H. Melot, D. Stevanović, Integral Complete Split Graphs, Univ. Beograd. Publ. Elektr. Fak, Ser. Mat. 13 (2002), 89–95
    
    

2001

13. D. Stevanović, Hosoya polynomial of composite graphs, Discrete Math. 235 (2001), 237–244

12. D. Stevanović, On the number of maximal independent sets of vertices in star-like ladders, Fibonacci Quarterly 39 (2001), no. 3, 211–213

11. D. Stevanović, Antipodal graphs of small diameter, FILOMAT (Nis) 15 (2001) 79–83
    
    

2000

10. D. Stevanović, When can the components of NEPS be almost cospectral?, Linear Algebra Appl. 311 (2000), 35–44

9. D. Cvetković, K. Ivanov, D. Stevanović, A catalogue of bicyclic graphs on 8 vertices, Univ. Beograd. Publ. Elektr. Fak, Ser. Mat. 11 (2000), 79–92
   
   

1999

8. D. Stevanović, When is NEPS of graphs connected?, Linear Algebra Appl. 301 (1999), 137–144

7. D. Stevanović, I. Gutman, Hosoya polynomials for trees with up to 10 vertices, Zbornik radova Prirodno-matematičkog fakulteta u Kragujevcu 21 (1999), 111–119

6. D. Stevanović, Nonexistence of some 4-regular integral graphs, Univ. Beograd. Publ. Elektr. Fak, Ser. Mat. 10 (1999), 81–86

5. D. Stevanović, An algorithm for constructing graphs with given eigenvalues and angles, Filomat (Niš) 13 (1999), 1–13
   
   

1998

4. D. Stevanović, Graphs with palindromic independence polynomial, Graph Theory Notes of New York 34 (1998), 31–36

3. D. Cvetković, S. Simić, D. Stevanović, 4-Regular integral graphs, Univ. Beograd. Publ. Elektr. Fak, Ser. Mat. 9 (1998), 89–102
   
   

1997

2. D. Stevanović, Some new recursive algorithms and heuristics for the maximum clique problem, XXIV Yugoslav Symposium on Operations Research, Bečići, 1997, 191–194

1. D. Stevanović, Clique polynomials of threshold graphs, Univ. Beograd. Publ. Elektr. Fak, Ser. Mat. 8 (1997), 84–87
   
   

BOOKS

3. D. Stevanović, M. Ćirić, S. Simić, V. Baltić, Discrete Mathematics— Basics of Combinatorics and Graph Theory (in Serbian, university textbook), Mathematical Society of Serbia, Belgrade, 2008

2. N.M.M. de Abreu, R.R. Del-Vecchio, C.T.M. Vinagre, D. Stevanović, Introduction to Spectral Graph Theory with Applications (in Portuguese), Notes in Applied Mathematics, Volume 27, Brazilian Society for Applied and Computational Mathematics, Sao Carlos, 2007

1. D. Stevanović, V. Baltić, M. Milošević, Discrete Mathematics—Basics of Combinatorics and Graph Theory (in Serbian, problembook with full solutions), Mathematical Society of Serbia, Belgrade, 2004
   
   

BOOK CHAPTERS

3. D. Stevanović, On the Randić index and Diameter of Chemical Graphs, in: Recent Results in the Theory of Randić Index, Mathematical Chemistry Monographs, Vol. 6, University of Kragujevac, Kragujevac, 2008, pp. 49-55.

2. P. Hansen, M. Aouchiche, G. Caporossi, H. M´elot, D. Stevanović, What Forms Do Interesting Conjectures Have in Graph Theory?, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 69: Graphs and Discovery, American Mathematical Society, 2005, 231– 252

1. D. Stevanović, G. Caporossi, On the (1, 2)-spectral spread of fullerenes, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 69: Graphs and Discovery, American Mathematical Society, 2005, 365–370.