default search action
Boris Furtula
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j20]Boris Furtula, Slavko Radenkovic
, Izudin Redzepovic
The generalized Zhang-Zhang polynomial of benzenoid systems - theory and applications. Appl. Math. Comput. 418: 126822 (2022) - [j19]Bojana Borovicanin
On the minimum Harary index of graphs with a given diameter or independence number. Discret. Appl. Math. 320: 331-345 (2022) - [j18]Zhao Wang, Yaping Mao
On relations between Sombor and other degree-based indices. J. Appl. Math. Comput. 68(1): 1-17 (2022) - 2021
- [j17]Sasa Vujosevic, Goran Popivoda, Zana Kovijanic Vukicevic, Boris Furtula
Arithmetic-geometric index and its relations with geometric-arithmetic index. Appl. Math. Comput. 391: 125706 (2021) - [j16]Muhuo Liu
Minimum augmented Zagreb index of c-cyclic graphs. Discret. Appl. Math. 295: 32-38 (2021) - [j15]Izudin Redzepovic
Effect of a Ring onto Values of Eigenvalue-Based Molecular Descriptors. Symmetry 13(8): 1515 (2021) - 2020
- [j14]Izudin Redzepovic
Predictive potential of eigenvalue-based topological molecular descriptors. J. Comput. Aided Mol. Des. 34(9): 975-982 (2020) - [j13]Risto Atanasov, Boris Furtula
Trees with Minimum Weighted Szeged Index Are of a Large Diameter. Symmetry 12(5): 793 (2020)
2010 – 2019
- 2019
- [j12]Boris Furtula
Some new lower bounds for augmented Zagreb index. J. Appl. Math. Comput. 61(1-2): 405-415 (2019) - [i1]Jan Bok, Boris Furtula, Nikola Jedlicková, Riste Skrekovski:
On Extremal Graphs of Weighted Szeged Index. CoRR abs/1901.04764 (2019) - 2018
- [j11]Ivan Gutman, Boris Furtula
Randić index and information. AKCE Int. J. Graphs Comb. 15(3): 307-312 (2018) - 2017
- [j10]Kinkar Chandra Das, Ivan Gutman
On spectral radius and energy of extended adjacency matrix of graphs. Appl. Math. Comput. 296: 116-123 (2017) - [j9]Ivan Gutman, Kinkar Chandra Das, Boris Furtula
Generalizations of Szőkefalvi Nagy and Chebyshev inequalities with applications in spectral graph theory. Appl. Math. Comput. 313: 235-244 (2017) - 2016
- [j8]Bojana Borovicanin
On extremal Zagreb indices of trees with given domination number. Appl. Math. Comput. 279: 208-218 (2016) - [j7]Ivan Gutman
On some degree-and-distance-based graph invariants of trees. Appl. Math. Comput. 289: 1-6 (2016) - 2014
- [j6]Boris Furtula
On difference of Zagreb indices. Discret. Appl. Math. 178: 83-88 (2014) - 2013
- [j5]Boris Furtula
On structure-sensitivity of degree-based topological indices. Appl. Math. Comput. 219(17): 8973-8978 (2013) - 2012
- [j4]Boris Furtula
Computer search for trees with minimal ABC index. Appl. Math. Comput. 219(2): 767-772 (2012) - 2011
- [j3]Kinkar Chandra Das, Ivan Gutman
On the first geometric-arithmetic index of graphs. Discret. Appl. Math. 159(17): 2030-2037 (2011)
2000 – 2009
- 2009
- [j2]Boris Furtula
Atom-bond connectivity index of trees. Discret. Appl. Math. 157(13): 2828-2835 (2009) - 2007
- [j1]Ivan Gutman
On the Cycle-Dependence of Topological Resonance Energy. J. Chem. Inf. Model. 47(3): 776-781 (2007)
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-10-07 21:21 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: