default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZoran Stanic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2025
[j48]Milica Andelic
, Zoran Stanic:
Laplacian eigenvalues of weighted threshold graphs. Comput. Appl. Math. 44(1): 38 (2025)- [j47]Muhuo Liu, Chaohui Chen, Zoran Stanic, Haiying Shan:
Graphs with Large Clique Number whose Second Largest Eigenvalue does not Exceed $(\sqrt{5}-1)/2$. Electron. J. Comb. 32(2) (2025) - [j46]Milica Andelic, Tamara Koledin, Zoran Stanic:
Cubic and quartic net-regular strongly regular signed graphs. Discret. Appl. Math. 366: 216-225 (2025) - [j45]Mir Riyaz Ul Rashid, Shariefuddin Pirzada, Zoran Stanic:
Spectra of the Mycielskian of a signed graph and related products. Discret. Appl. Math. 370: 124-144 (2025) - [j44]Jiachang Ye, Jianguo Qian, Zoran Stanic:
Determining some graph joins by the signless Laplacian spectrum. Discret. Appl. Math. 375: 17-24 (2025) - [j43]Peter Rowlinson, Zoran Stanic:
On regular graphs with a tree of diameter 3 as a star complement. Discret. Math. 348(8): 114488 (2025) - 2024
- [j42]Zoran Stanic:
Spectra of signed graphs and related oriented graphs. Ars Math. Contemp. 24(3): 3 (2024) - [j41]Zoran Stanic:
Linear ternary codes of strongly regular signed graphs. Discret. Math. 347(1): 113714 (2024) - [j40]Xing Gao, Zoran Stanic, Jianfeng Wang:
Graphs with large multiplicity of -2 in the spectrum of the eccentricity matrix. Discret. Math. 347(7): 114038 (2024) - [j39]Muhuo Liu, Chaohui Chen, Zoran Stanic:
Connected (K4-e)-free graphs whose second largest eigenvalue does not exceed 1. Eur. J. Comb. 115: 103775 (2024) - [j38]Muhuo Liu, Xiaofeng Gu, Haiying Shan, Zoran Stanic:
Spectral characterization of the complete graph removing a cycle. J. Comb. Theory, Ser. A 205: 105868 (2024) - [j37]Jianfeng Wang, Wenqian Zhang, Yiqiao Wang, Zoran Stanic:
On the order of antipodal covers. J. Graph Theory 105(2): 285-296 (2024) - 2023
- [j36]Fang Duan, Qiongxiang Huang, Xueyi Huang, Zoran Stanic, Jianfeng Wang:
A complete characterization of graphs with exactly two positive eigenvalues. Adv. Appl. Math. 144: 102457 (2023) - [j35]Milica Andelic, Tamara Koledin, Zoran Stanic, Jianfeng Wang:
Signed graphs with integral net Laplacian spectrum. AKCE Int. J. Graphs Comb. 20(2): 177-184 (2023) - [j34]Abdullah Alazemi, Milica Andelic, Tamara Koledin, Zoran Stanic:
Chain graphs with simple Laplacian eigenvalues and their Laplacian dynamics. Comput. Appl. Math. 42(1) (2023) - [j33]Zoran Stanic:
Estimating distance between an eigenvalue of a signed graph and the spectrum of an induced subgraph. Discret. Appl. Math. 340: 32-40 (2023) - [j32]Irene Sciriha, Zoran Stanic:
The polynomial reconstruction problem: The first 50 years. Discret. Math. 346(6): 113349 (2023) - [j31]Milica Andelic, Carlos M. da Fonseca, Tamara Koledin, Zoran Stanic:
An extended eigenvalue-free interval for the eccentricity matrix of threshold graphs. J. Appl. Math. Comput. 69(1): 491-503 (2023) - 2022
- [j30]Peter Rowlinson, Zoran Stanic:
Signed graphs whose spectrum is bounded by -2. Appl. Math. Comput. 423: 126991 (2022) - [j29]Maurizio Brunetti, Zoran Stanic:
Ordering signed graphs with large index. Ars Math. Contemp. 22(4): 4 (2022) - [j28]Francesco Belardo, Zoran Stanic, Tomas Zaslavsky:
Total graph of a signed graph. Ars Math. Contemp. 23(1) (2022) - [j27]Maurizio Brunetti, Zoran Stanic:
Unbalanced signed graphs with extremal spectral radius or index. Comput. Appl. Math. 41(3) (2022) - [j26]Zoran Stanic:
Some properties of the eigenvalues of the net Laplacian matrix of a signed graph. Discuss. Math. Graph Theory 42(3): 893-903 (2022) - [j25]Farzaneh Ramezani, Peter Rowlinson, Zoran Stanic:
More on signed graphs with at most three eigenvalues. Discuss. Math. Graph Theory 42(4): 1313-1331 (2022) - 2021
- [j24]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) - [j23]Muhuo Liu, Chaohui Chen, Zoran Stanic:
On graphs whose second largest eigenvalue is at most 1. Eur. J. Comb. 97: 103385 (2021) - [j22]Zoran Stanic:
Lower bounds for the algebraic connectivity of graphs with specified subgraphs. Electron. J. Graph Theory Appl. 9(2): 257-264 (2021) - [j21]Milica Andelic, Tamara Koledin, Zoran Stanic:
Inequalities for Laplacian Eigenvalues of Signed Graphs with Given Frustration Number. Symmetry 13(10): 1902 (2021) - 2020
- [j20]Zoran Stanic:
Spectra of signed graphs with two eigenvalues. Appl. Math. Comput. 364 (2020) - [j19]Zoran Stanic:
Notes on exceptional signed graphs. Ars Math. Contemp. 18(1): 105-115 (2020) - [j18]Zoran Stanic:
Corrigendum to "On strongly regular signed graphs" [Discrete Applied Mathematics 271 (2019) 184-190]. Discret. Appl. Math. 284: 640 (2020) - [j17]Zoran Stanic:
Net Laplacian controllability for joins of signed graphs. Discret. Appl. Math. 285: 197-203 (2020) - [j16]Farzaneh Ramezani, Peter Rowlinson, Zoran Stanic:
On eigenvalue multiplicity in signed graphs. Discret. Math. 343(10): 111982 (2020) - [j15]Milica Andelic, Francesco Belardo, Zoran Stanic:
Preface. Discuss. Math. Graph Theory 40(2): 365-366 (2020) - [j14]Milica Andelic, Tamara Koledin, Zoran Stanic:
On regular signed graphs with three eigenvalues. Discuss. Math. Graph Theory 40(2): 405-416 (2020) - [j13]Milica Andelic, Maurizio Brunetti, Zoran Stanic:
Laplacian Controllability for Graphs Obtained by Some Standard Products. Graphs Comb. 36(5): 1593-1602 (2020) - 2019
- [j12]Zoran Stanic:
Integral regular net-balanced signed graphs with vertex degree at most four. Ars Math. Contemp. 17(1): 103-114 (2019) - [j11]Zoran Stanic:
On strongly regular signed graphs. Discret. Appl. Math. 271: 184-190 (2019) - 2018
- [j10]Ivana Jovovic, Tamara Koledin, Zoran Stanic:
Trees with small spectral gap. Ars Math. Contemp. 14(1): 197-207 (2018) - [j9]Zoran Stanic:
Perturbations in a signed graph and its index. Discuss. Math. Graph Theory 38(3): 841-852 (2018) - 2014
- [j8]Zoran Stanic:
Further results on controllable graphs. Discret. Appl. Math. 166: 215-221 (2014) - 2013
- [j7]Milica Andelic, Carlos M. da Fonseca, Tamara Koledin, Zoran Stanic:
Sharp spectral inequalities for connected bipartite graphs with maximal Q-index. Ars Math. Contemp. 6(1): 171-185 (2013) - 2011
- [j6]Türker Bíyíkoglu, Slobodan K. Simic, Zoran Stanic:
Some Notes On Spectra Of Cographs. Ars Comb. 100: 421-434 (2011) - 2010
- [j5]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) - 2009
- [j4]Zoran Stanic:
Some Results On Q-Integral Graphs. Ars Comb. 90 (2009) - [j3]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
- [j2]Zoran Stanic:
Some star complements for the second largest eigenvalue of a graph. Ars Math. Contemp. 1(2): 126-136 (2008) - [j1]Slobodan K. Simic, Zoran Stanic:
Q-integral graphs with edge-degrees at most five. Discret. Math. 308(20): 4625-4634 (2008)
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-08-12 01:06 CEST 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:
