Slobodan K. Simić

1.7k total citations · 1 hit paper
62 papers, 1.3k citations indexed

About

Slobodan K. Simić is a scholar working on Geometry and Topology, Computational Theory and Mathematics and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Slobodan K. Simić has authored 62 papers receiving a total of 1.3k indexed citations (citations by other indexed papers that have themselves been cited), including 58 papers in Geometry and Topology, 52 papers in Computational Theory and Mathematics and 19 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Slobodan K. Simić's work include Graph theory and applications (56 papers), Advanced Graph Theory Research (30 papers) and Finite Group Theory Research (16 papers). Slobodan K. Simić is often cited by papers focused on Graph theory and applications (56 papers), Advanced Graph Theory Research (30 papers) and Finite Group Theory Research (16 papers). Slobodan K. Simić collaborates with scholars based in Serbia, Italy and Kuwait. Slobodan K. Simić's co-authors include Dragoš Cvetković, Peter Rowlinson, Francesco Belardo, Zoran Stanić, F.K. Bell, Milica Anđelić, Domingos M. Cardoso, Carlos M. da Fonseca, Jianfeng Wang and Türker Bı́yı́koğlu and has published in prestigious journals such as SHILAP Revista de lepidopterología, Applied Mathematics and Computation and Computers & Mathematics with Applications.

In The Last Decade

Slobodan K. Simić

61 papers receiving 1.2k citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

Signless Laplacians of finite graphs

2007 365 citations Dragoš Cvetković, Peter Rowlinson et al. Linear Algebra and its Applications profile →

Peers

Slobodan K. Simić

GT

CTM

OC

DMC

MC

Yi-Zheng Fan China

Lihua Feng China

Mustapha Aouchiche Canada

Juan Rada Colombia

Jinlong Shu China

Weigen Yan China

S. Pirzada India

Yaoping Hou China

Xueliang Li China

Shuchao Li China

Yi-Zheng Fan China

Slobodan K. Simić

894 ×0.8

GT

716 ×0.9

CTM

345 ×0.6

OC

228 ×0.6

DMC

85 ×1.0

MC

Citations per year, relative to Slobodan K. Simić Slobodan K. Simić (= 1×) peers Yi-Zheng Fan

Countries citing papers authored by Slobodan K. Simić

Since Specialization

Citations

This map shows the geographic impact of Slobodan K. Simić's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Slobodan K. Simić with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Slobodan K. Simić more than expected).

Fields of papers citing papers by Slobodan K. Simić

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Slobodan K. Simić. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Slobodan K. Simić. The network helps show where Slobodan K. Simić may publish in the future.

Co-authorship network of co-authors of Slobodan K. Simić

This figure shows the co-authorship network connecting the top 25 collaborators of Slobodan K. Simić. A scholar is included among the top collaborators of Slobodan K. Simić based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Slobodan K. Simić. Slobodan K. Simić is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Simić, Slobodan K.. (2018). Aphorism from medicine till satire. 40(1). 49–55. 1 indexed citations

2.

Simić, Slobodan K. & Zoran Stanić. (2016). Polynomial reconstruction of signed graphs. Linear Algebra and its Applications. 501. 390–408. 6 indexed citations

3.

Belardo, Francesco, et al.. (2016). Signed line graphs with least eigenvalue −2: The star complement technique. Discrete Applied Mathematics. 207. 29–38. 6 indexed citations

4.

Belardo, Francesco, Irene Sciriha, & Slobodan K. Simić. (2016). On eigenspaces of some compound signed graphs. Linear Algebra and its Applications. 509. 19–39. 1 indexed citations

5.

Cvetković, Dragoš, Peter Rowlinson, & Slobodan K. Simić. (2015). Graphs with least eigenvalue −2: Ten years on. Linear Algebra and its Applications. 484. 504–539. 9 indexed citations

6.

Belardo, Francesco & Slobodan K. Simić. (2015). On the Laplacian coefficients of signed graphs. Linear Algebra and its Applications. 475. 94–113. 48 indexed citations

7.

Bı́yı́koğlu, Türker, Slobodan K. Simić, & Zoran Stanić. (2011). Some notes on spectra of cographs. Ars Combinatoria. 100. 421–434. 20 indexed citations

8.

Li, Shuchao, et al.. (2011). On ordering bicyclic graphs with respect to the Laplacian spectral radius. Applied Mathematics Letters. 24(12). 2186–2192. 4 indexed citations

9.

Belardo, Francesco, et al.. (2010). Combinatorial approach for computing the characteristic polynomial of a matrix. Linear Algebra and its Applications. 433(8-10). 1513–1523. 25 indexed citations

10.

Belardo, Francesco, et al.. (2009). Trees with minimal index and diameter at most four. Discrete Mathematics. 310(12). 1708–1714. 3 indexed citations

11.

Simić, Slobodan K., et al.. (2009). Connected graphs of fixed order and size with maximal index: Some spectral bounds. Linear Algebra and its Applications. 432(9). 2361–2372. 14 indexed citations

12.

Bell, F.K., Dragoš Cvetković, Peter Rowlinson, & Slobodan K. Simić. (2008). Graphs for which the least eigenvalue is minimal, I. Linear Algebra and its Applications. 429(1). 234–241. 52 indexed citations

13.

Bell, F.K., Dragoš Cvetković, Peter Rowlinson, & Slobodan K. Simić. (2008). Graphs for which the least eigenvalue is minimal, II. Linear Algebra and its Applications. 429(8-9). 2168–2179. 67 indexed citations

14.

Simić, Slobodan K., et al.. (2007). On the index of caterpillars. Discrete Mathematics. 308(2-3). 324–330. 16 indexed citations

15.

Cvetković, Dragoš, Peter Rowlinson, & Slobodan K. Simić. (2007). Signless Laplacians of finite graphs. Linear Algebra and its Applications. 423(1). 155–171. 365 indexed citations breakdown →

16.

Simić, Slobodan K., et al.. (2004). Connected graphs of fixed order and size with maximal index: structural considerations. SHILAP Revista de lepidopterología. 20 indexed citations

17.

Simić, Slobodan K., et al.. (2001). The nonregular, bipartite, integral graphs with maximum degree 4. Part I: basic properties. Discrete Mathematics. 236(1-3). 13–24. 21 indexed citations

18.

Cvetković, Dragoš, Peter Rowlinson, & Slobodan K. Simić. (1999). Some characterizations of graphs by star complements. Linear Algebra and its Applications. 301(1-3). 81–97. 15 indexed citations

19.

Simić, Slobodan K.. (1987). On the Largest Eigenvalue of Unicyclic Graphs. Publications de l Institut Mathematique. 13–19. 32 indexed citations

20.

Cvetković, Dragoš & Slobodan K. Simić. (1975). Graph equations for line graphs and total graphs. Discrete Mathematics. 13(4). 315–320. 6 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact