Zoran Stanic

Orcid: 0000-0002-4949-4203

According to our database1, Zoran Stanic authored at least 39 papers between 2008 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the order of antipodal covers.
J. Graph Theory, February, 2024

Connected (K4-e)-free graphs whose second largest eigenvalue does not exceed 1.
Eur. J. Comb., January, 2024

Linear ternary codes of strongly regular signed graphs.
Discret. Math., January, 2024

2023
Estimating distance between an eigenvalue of a signed graph and the spectrum of an induced subgraph.
Discret. Appl. Math., December, 2023

The polynomial reconstruction problem: The first 50 years.
Discret. Math., June, 2023

Signed graphs with integral net Laplacian spectrum.
AKCE Int. J. Graphs Comb., May, 2023

An extended eigenvalue-free interval for the eccentricity matrix of threshold graphs.
J. Appl. Math. Comput., February, 2023

Chain graphs with simple Laplacian eigenvalues and their Laplacian dynamics.
Comput. Appl. Math., February, 2023

A complete characterization of graphs with exactly two positive eigenvalues.
Adv. Appl. Math., 2023

2022
Total graph of a signed graph.
Ars Math. Contemp., October, 2022

Unbalanced signed graphs with extremal spectral radius or index.
Comput. Appl. Math., April, 2022

Some properties of the eigenvalues of the net Laplacian matrix of a signed graph.
Discuss. Math. Graph Theory, 2022

More on signed graphs with at most three eigenvalues.
Discuss. Math. Graph Theory, 2022

Ordering signed graphs with large index.
Ars Math. Contemp., 2022

Signed graphs whose spectrum is bounded by -2.
Appl. Math. Comput., 2022

2021
Inequalities for Laplacian Eigenvalues of Signed Graphs with Given Frustration Number.
Symmetry, 2021

Lower bounds for the algebraic connectivity of graphs with specified subgraphs.
Electron. J. Graph Theory Appl., 2021

On graphs whose second largest eigenvalue is at most 1.
Eur. J. Comb., 2021

The main vertices of a star set and related graph parameters.
Discret. Math., 2021

2020
Laplacian Controllability for Graphs Obtained by Some Standard Products.
Graphs Comb., 2020

On regular signed graphs with three eigenvalues.
Discuss. Math. Graph Theory, 2020

Preface.
Discuss. Math. Graph Theory, 2020

On eigenvalue multiplicity in signed graphs.
Discret. Math., 2020

Net Laplacian controllability for joins of signed graphs.
Discret. Appl. Math., 2020

Corrigendum to "On strongly regular signed graphs" [Discrete Applied Mathematics 271 (2019) 184-190].
Discret. Appl. Math., 2020

Notes on exceptional signed graphs.
Ars Math. Contemp., 2020

Spectra of signed graphs with two eigenvalues.
Appl. Math. Comput., 2020

2019
On strongly regular signed graphs.
Discret. Appl. Math., 2019

Integral regular net-balanced signed graphs with vertex degree at most four.
Ars Math. Contemp., 2019

2018
Perturbations in a signed graph and its index.
Discuss. Math. Graph Theory, 2018

Trees with small spectral gap.
Ars Math. Contemp., 2018

2014
Further results on controllable graphs.
Discret. Appl. Math., 2014

2013
Sharp spectral inequalities for connected bipartite graphs with maximal Q-index.
Ars Math. Contemp., 2013

2011
Some Notes On Spectra Of Cographs.
Ars Comb., 2011

2010
Spectral determination of graphs whose components are paths and cycles.
Comput. Math. Appl., 2010

2009
On some forests determined by their Laplacian or signless Laplacian spectrum.
Comput. Math. Appl., 2009

Some Results On Q-Integral Graphs.
Ars Comb., 2009

2008
Q-integral graphs with edge-degrees at most five.
Discret. Math., 2008

Some star complements for the second largest eigenvalue of a graph.
Ars Math. Contemp., 2008


  Loading...