default search action
Francesco Belardo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j32]Peichao Wei, Wuding Jia, Francesco Belardo
, Muhuo Liu
Maximal Lanzhou index of trees and unicyclic graphs with prescribed diameter. Appl. Math. Comput. 488: 129116 (2025) - 2024
- [j31]Francesco Belardo
Limit points of (signless) Laplacian spectral radii of linear trees. Appl. Math. Comput. 477: 128819 (2024) - [j30]Francesco Belardo, Maurizio Brunetti
Limit points for the spectral radii of signed graphs. Discret. Math. 347(2): 113745 (2024) - [j29]Aida Abiad
A switching method for constructing cospectral gain graphs. Discret. Math. 347(4): 113838 (2024) - 2023
- [j28]Muhuo Liu, Shumei Pang, Francesco Belardo
The k-apex trees with minimum augmented Zagreb index. Discret. Math. 346(7): 113390 (2023) - 2022
- [j27]Francesco Belardo
Total graph of a signed graph. Ars Math. Contemp. 23(1) (2022) - 2021
- [j26]Francesco Belardo
Locating eigenvalues of unbalanced unicyclic signed graphs. Appl. Math. Comput. 400: 126082 (2021) - [j25]Kun Cheng, Muhuo Liu, Francesco Belardo
The minimal augmented Zagreb index of k-apex trees for k∈{1, 2, 3}. Appl. Math. Comput. 402: 126139 (2021) - 2020
- [j24]Jianfeng Wang
Spectral properties of the eccentricity matrix of graphs. Discret. Appl. Math. 279: 168-177 (2020) - [j23]Milica Andelic, Francesco Belardo
Preface. Discuss. Math. Graph Theory 40(2): 365-366 (2020) - [j22]Francesco Belardo
Balancedness and the least Laplacian eigenvalue of some complex unit gain graphs. Discuss. Math. Graph Theory 40(2): 417-433 (2020) - [j21]Francesco Belardo
Graphs whose Aα radius does not exceed 2. Discuss. Math. Graph Theory 40(2): 677-690 (2020)
2010 – 2019
- 2019
- [j20]Francesco Belardo
Edge perturbation on signed graphs with clusters: Adjacency and Laplacian eigenvalues. Discret. Appl. Math. 269: 130-138 (2019) - [j19]Yuedan Yao, Muhuo Liu
Unified extremal results of topological indices and spectral invariants of graphs. Discret. Appl. Math. 271: 218-232 (2019) - [j18]Francesco Belardo
On the multiplicity of α as an Aα(Γ)-eigenvalue of signed graphs with pendant vertices. Discret. Math. 342(8): 2223-2233 (2019) - [i1]Francesco Belardo, Sebastian M. Cioaba, Jack H. Koolen, Jianfeng Wang:
Open problems in the spectral theory of signed graphs. CoRR abs/1907.04349 (2019) - 2018
- [j17]Francesco Belardo
The International Congress on Hypergraphs, Graphs and Designs – HyGraDe 2017. Art Discret. Appl. Math. 1(2): #E2.01 (2018) - [j16]Francesco Belardo
Open problems in the spectral theory of signed graphs. Art Discret. Appl. Math. 1(2): #P2.10 (2018) - [j15]Francesco Belardo
Wreath product of a complete graph with a cyclic graph: Topological indices and spectrum. Appl. Math. Comput. 336: 288-300 (2018) - [j14]Xiyuan Feng, Jianfeng Wang, Francesco Belardo:
Spectral characterizations of graphs with at most two (signless) Laplacian eigenvalues greater than 2. Ars Comb. 139: 43-54 (2018) - [j13]Jianfeng Wang
The anti-adjacency matrix of a graph: Eccentricity matrix. Discret. Appl. Math. 251: 299-309 (2018) - 2016
- [j12]Francesco Belardo
Signed line graphs with least eigenvalue -2: The star complement technique. Discret. Appl. Math. 207: 29-38 (2016) - 2013
- [j11]Jianfeng Wang, Qiongxiang Huang, Kok Lay Teo, Francesco Belardo, Ruying Liu, Chengfu Ye:
Almost every complement of a tadpole graph is not chromatically unique. Ars Comb. 108: 33-49 (2013) - [j10]Jianfeng Wang
Signless Laplacian eigenvalues and circumference of graphs. Discret. Appl. Math. 161(10-11): 1610-1617 (2013) - [j9]Francesco Belardo
Perturbations on bidegreed graphs minimizing the spectral radius. Electron. Notes Discret. Math. 40: 33-37 (2013) - 2010
- [j8]Jianfeng Wang
Some results on the signless Laplacians of graphs. Appl. Math. Lett. 23(9): 1045-1049 (2010) - [j7]Jianfeng Wang, Francesco Belardo, Qiongxiang Huang, Enzo Maria Li Marzi:
Spectral Characterizations of Dumbbell Graphs. Electron. J. Comb. 17(1) (2010) - [j6]Francesco Belardo
Trees with minimal index and diameter at most four. Discret. Math. 310(12): 1708-1714 (2010) - [j5]Jianfeng Wang
On the spectral characterizations of ∞-graphs. Discret. Math. 310(13-14): 1845-1855 (2010) - [j4]Jianfeng Wang
On the two largest Q-eigenvalues of graphs. Discret. Math. 310(21): 2858-2866 (2010) - [j3]Francesco Belardo
On the Index of Necklaces. Graphs Comb. 26(2): 163-172 (2010)
2000 – 2009
- 2008
- [j2]Francesco Belardo
Ordering graphs with index in the interval (2, sqrt(2+sqrt(5))). Discret. Appl. Math. 156(10): 1670-1682 (2008) - [j1]Slobodan K. Simic, Enzo Maria Li Marzi, Francesco Belardo
On the index of caterpillars. Discret. Math. 308(2-3): 324-330 (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 2024-11-07 20:34 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: