Browsing by Author Stevanović, Dragan

Or, select a letter below to browse by last name
0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Showing results 117 to 125 of 125 < previous 
Author(s)TitleIssue DateAppears inRank
Aouchiche, Mustapha; Bell, Francis; Cvetković, Dragoš; Hansen, Pierre; Rowlinson, Peter; Simić, Slobodan ; Stevanović, Dragan Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph16-Dec-2008European Journal of Operational Research; 191(3); 661-676M21
Aouchiche, Mustapha; Hansen, Pierre; Stevanović, Dragan Variable neighborhood search for extremal graphs. 17. further conjectures and results about the index1-Jan-2009Discussiones Mathematicae - Graph Theory; 29(1); 15-37
Stevanović, Sanja ; Stevanović, Dragan Visual Proofs for the Sums of Fourth and Fifth Powers of the First n Natural Numbers1-Mar-2021College Mathematics Journal; 52(2); 115-120
Feng, Lihua; Lu, Lu; Stevanović, Dragan Walk counting and Nikiforov’s problem10-Feb-2020Open Journal of Discrete Applied Mathematics; 3(1); 11-19M53
Stevanović, Dragan Walk counts and the spectral radius of graphs2015Bulletin de l'Académie serbe des sciences. Classe des sciences mathématiques et naturelles. Sciences mathématiques; 40; 33-57M51
Stevanović, Sanja ; Stevanović, Dragan A walk-regular graph, cospectral to its complement, need not be strongly regular1-Oct-2023Discrete Mathematics~M22
Stevanović, Dragan ; de Abreu, Nair; de Freitas, Maria; Del-Vecchio, RenataWalks and regular integral graphs1-May-2007Linear Algebra and Its Applications; 423(1); 119-135M22
Stevanović, Dragan When can the components of NEPS of connected bipartite graphs be almost cospectral?15-May-2000Linear Algebra and Its Applications; 311(1-3); 35-44M22
Stevanović, Dragan When is NEPS of graphs connected?1-Nov-1999Linear Algebra and Its Applications; 301(1-3); 137-144M22