Aleksandar Ilic

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Matthias Dehmer

> Home > Persons > Aleksandar Ilic

Publications

2021
[j68]
- view
  authority control:
- export record
  dblp key:
  - journals/dam/IlicGAD21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/IlicGAD21
Aleksandar Ilic, Modjtaba Ghorbani, Seyran Azizi, Matthias Dehmer:
On conjectures of network distance measures by using graph spectra. Discret. Appl. Math. 302: 248-255 (2021)
2020
[j65]
- view
  authority control:
- export record
  dblp key:
  - journals/amc/DehmerEMICYFGVT20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/amc/DehmerEMICYFGVT20
Matthias Dehmer, Frank Emmert-Streib, Abbe Mowshowitz, Aleksandar Ilic, Zengqiang Chen, Guihai Yu, Lihua Feng, Modjtaba Ghorbani, Kurt Varmuza, Jin Tao:
Relations and bounds for the zeros of graph polynomials using vertex orbits. Appl. Math. Comput. 380: 125239 (2020)
2015
[j38]
- view
  authority control:
- export record
  dblp key:
  - journals/amc/IlicD15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/amc/IlicD15
Aleksandar Ilic, Matthias Dehmer:
On the distance based graph entropies. Appl. Math. Comput. 269: 647-650 (2015)
2011
[j17]
- view
  authority control:
- export record
  dblp key:
  - journals/complexity/DiudeaIVD11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/complexity/DiudeaIVD11
Mircea V. Diudea, Aleksandar Ilic, Kurt Varmuza, Matthias Dehmer:
Network analysis using a novel highly discriminating topological index. Complex. 16(6): 32-39 (2011)

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.