default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSlobodan K. Simic
Person information
- affiliation: Serbian Academy of Sciences and Arts (SANU), Belgrade, Mathematical Institute
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j29]Milica Andelic
, Domingos M. Cardoso, Slobodan K. Simic, Zoran Stanic:
The main vertices of a star set and related graph parameters. Discret. Math. 344(12): 112593 (2021)
2010 – 2019
- 2019
- [j28]Milica Andelic, Ebrahim Ghorbani, Slobodan K. Simic:
Vertex types in threshold and chain graphs. Discret. Appl. Math. 269: 159-168 (2019) - 2018
- [j27]Milica Andelic, Slobodan K. Simic, Dejan Zivkovic, E. C. Dolicanin:
Fast algorithms for computing the characteristic polynomial of threshold and chain graphs. Appl. Math. Comput. 332: 329-337 (2018) - 2016
- [j26]Francesco Belardo, Enzo Maria Li Marzi, Slobodan K. Simic:
Signed line graphs with least eigenvalue -2: The star complement technique. Discret. Appl. Math. 207: 29-38 (2016) - 2012
- [j25]Milica Andelic, Carlos M. da Fonseca, Slobodan K. Simic, Dejan V. Tosic:
Connected graphs of fixed order and size with maximal Q-index: Some spectral bounds. Discret. Appl. Math. 160(4-5): 448-459 (2012) - 2011
- [j24]Shuchao Li, Slobodan K. Simic, Dejan V. Tosic, Qin Zhao:
On ordering bicyclic graphs with respect to the Laplacian spectral radius. Appl. Math. Lett. 24(12): 2186-2192 (2011) - [j23]Türker Bíyíkoglu, Slobodan K. Simic, Zoran Stanic:
Some Notes On Spectra Of Cographs. Ars Comb. 100: 421-434 (2011) - 2010
- [j22]Dragos M. Cvetkovic, Tatjana Davidovic, Aleksandar Ilic, Slobodan K. Simic:
Graphs for small multiprocessor interconnection networks. Appl. Math. Comput. 217(6): 2468-2480 (2010) - [j21]Dragos M. Cvetkovic, Slobodan K. Simic, Zoran Stanic:
Spectral determination of graphs whose components are paths and cycles. Comput. Math. Appl. 59(12): 3849-3857 (2010) - [j20]Francesco Belardo, Enzo Maria Li Marzi, Slobodan K. Simic:
Trees with minimal index and diameter at most four. Discret. Math. 310(12): 1708-1714 (2010) - [j19]Milica Andelic, Slobodan K. Simic:
Some notes on the threshold graphs. Discret. Math. 310(17-18): 2241-2248 (2010) - [j18]Francesco Belardo, Enzo Maria Li Marzi, Slobodan K. Simic, Jianfeng Wang:
On the Index of Necklaces. Graphs Comb. 26(2): 163-172 (2010)
2000 – 2009
- 2009
- [j17]Slobodan K. Simic, Zoran Stanic:
On some forests determined by their Laplacian or signless Laplacian spectrum. Comput. Math. Appl. 58(1): 171-178 (2009) - 2008
- [j16]Francesco Belardo, Enzo Maria Li Marzi, Slobodan K. Simic:
Ordering graphs with index in the interval (2, sqrt(2+sqrt(5))). Discret. Appl. Math. 156(10): 1670-1682 (2008) - [j15]Slobodan K. Simic, Enzo Maria Li Marzi, Francesco Belardo:
On the index of caterpillars. Discret. Math. 308(2-3): 324-330 (2008) - [j14]Slobodan K. Simic, Zoran Stanic:
Q-integral graphs with edge-degrees at most five. Discret. Math. 308(20): 4625-4634 (2008) - [j13]Mustapha Aouchiche, Francis K. Bell, Dragos M. Cvetkovic, Pierre Hansen, Peter Rowlinson, Slobodan K. Simic, Dragan Stevanovic:
Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph. Eur. J. Oper. Res. 191(3): 661-676 (2008) - 2007
- [j12]Slavica M. Perovich, Slobodan K. Simic, Dejan V. Tosic, Sanja I. Bauk:
On the analytical solution of some families of transcendental equations. Appl. Math. Lett. 20(5): 493-498 (2007) - 2005
- [j11]Dragos M. Cvetkovic, Peter Rowlinson, Slobodan K. Simic:
Graphs With Least Eigenvalue -2: A New Proof of the 31 Forbidden Subgraphs Theorem. Des. Codes Cryptogr. 34(2-3): 229-240 (2005) - 2004
- [j10]Krystyna T. Balinska, Slobodan K. Simic, Krzysztof T. Zwierzyski:
Which non-regular bipartite integral graphs with maximum degree four do not have pm1 as eigenvalues? Discret. Math. 286(1-2): 15-24 (2004) - 2002
- [j9]Dragos M. Cvetkovic, Mirko Lepovic, Peter Rowlinson, Slobodan K. Simic:
The Maximal Exceptional Graphs. J. Comb. Theory B 86(2): 347-363 (2002) - 2001
- [j8]Krystyna T. Balinska, Slobodan K. Simic:
The nonregular, bipartite, integral graphs with maximum degree 4. Part I: basic properties. Discret. Math. 236(1-3): 13-24 (2001) - [c1]Dragos M. Cvetkovic, Slobodan K. Simic:
Graph Theoretical Results Obtained by the Support of the Expert System "Graph" - An Extended Survey. Graphs and Discovery 2001: 39-70
1990 – 1999
- 1999
- [j7]Francis K. Bell, Dragos M. Cvetkovic, Peter Rowlinson, Slobodan K. Simic:
Some additions to the theory of star partitions of graphs. Discuss. Math. Graph Theory 19(2): 119-134 (1999) - 1995
- [j6]Dragos M. Cvetkovic, Peter Rowlinson, Slobodan K. Simic:
on Some Algorithmic Investigations of Star Partitions of Graphs. Discret. Appl. Math. 62(1-3): 119-130 (1995) - [j5]Dragos M. Cvetkovic, Slobodan K. Simic:
On graphs whose second largest eigenvalue does not exceed (sqrt(5)-1)/2. Discret. Math. 138(1-3): 213-227 (1995)
1980 – 1989
- 1981
- [j4]Dragos M. Cvetkovic, Michael Doob, Slobodan K. Simic:
Generalized line graphs. J. Graph Theory 5(4): 385-399 (1981)
1970 – 1979
- 1979
- [j3]Dragos M. Cvetkovic, Slobodan K. Simic:
A bibliography of graph equations. J. Graph Theory 3(4): 311-324 (1979) - [j2]David J. Oberly, Slobodan K. Simic, David P. Sumner:
Every connected, locally connected nontrivial graph with no induced claw is hamiltonian. J. Graph Theory 3(4): 351-356 (1979) - 1975
- [j1]Dragos M. Cvetkovic, Slobodan K. Simic:
Graph equations for line graphs and total graphs. Discret. Math. 13(4): 315-320 (1975)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
