Francesco Belardo

Orcid: 0000-0003-4253-2905

According to our database1, Francesco Belardo authored at least 30 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A switching method for constructing cospectral gain graphs.
Discret. Math., April, 2024

Limit points for the spectral radii of signed graphs.
Discret. Math., February, 2024

2023
The <i>k</i>-apex trees with minimum augmented Zagreb index.
Discret. Math., July, 2023

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

2021
The minimal augmented Zagreb index of k-apex trees for k∈{1, 2, 3}.
Appl. Math. Comput., 2021

Locating eigenvalues of unbalanced unicyclic signed graphs.
Appl. Math. Comput., 2021

2020
Graphs whose <i>A<sub>α</sub></i> radius does not exceed 2.
Discuss. Math. Graph Theory, 2020

Balancedness and the least Laplacian eigenvalue of some complex unit gain graphs.
Discuss. Math. Graph Theory, 2020

Preface.
Discuss. Math. Graph Theory, 2020

Spectral properties of the eccentricity matrix of graphs.
Discret. Appl. Math., 2020

2019
On the multiplicity of α as an Aα(Γ)-eigenvalue of signed graphs with pendant vertices.
Discret. Math., 2019

Unified extremal results of topological indices and spectral invariants of graphs.
Discret. Appl. Math., 2019

Edge perturbation on signed graphs with clusters: Adjacency and Laplacian eigenvalues.
Discret. Appl. Math., 2019

2018
The anti-adjacency matrix of a graph: Eccentricity matrix.
Discret. Appl. Math., 2018

Spectral characterizations of graphs with at most two (signless) Laplacian eigenvalues greater than 2.
Ars Comb., 2018

Wreath product of a complete graph with a cyclic graph: Topological indices and spectrum.
Appl. Math. Comput., 2018

Open problems in the spectral theory of signed graphs.
Art Discret. Appl. Math., 2018

The International Congress on Hypergraphs, Graphs and Designs – HyGraDe 2017.
Art Discret. Appl. Math., 2018

2016
Signed line graphs with least eigenvalue -2: The star complement technique.
Discret. Appl. Math., 2016

2013
Perturbations on bidegreed graphs minimizing the spectral radius.
Electron. Notes Discret. Math., 2013

Signless Laplacian eigenvalues and circumference of graphs.
Discret. Appl. Math., 2013

Almost every complement of a tadpole graph is not chromatically unique.
Ars Comb., 2013

2010
On the Index of Necklaces.
Graphs Comb., 2010

On the spectral characterizations of ∞-graphs.
Discret. Math., 2010

On the two largest Q-eigenvalues of graphs.
Discret. Math., 2010

Trees with minimal index and diameter at most four.
Discret. Math., 2010

Spectral Characterizations of Dumbbell Graphs.
Electron. J. Comb., 2010

Some results on the signless Laplacians of graphs.
Appl. Math. Lett., 2010

2008
On the index of caterpillars.
Discret. Math., 2008

Ordering graphs with index in the interval (2, sqrt(2+sqrt(5))).
Discret. Appl. Math., 2008


  Loading...