default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMilica Andelic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]Abdullah Alazemi, Milica Andelic
, Jovana Milenkovic, Jovana Nikolov Radenkovic:
Combinatorial versus algebraic formulae for the Moore-Penrose inverse of a Laplacian matrix of a threshold graph. J. Comput. Appl. Math. 442: 115714 (2024)- 2023
- [j18]Milica Andelic, Tamara Koledin, Zoran Stanic, Jianfeng Wang:
Signed graphs with integral net Laplacian spectrum. AKCE Int. J. Graphs Comb. 20(2): 177-184 (2023) - [j17]Abdullah Alazemi, Milica Andelic, Tamara Koledin, Zoran Stanic:
Chain graphs with simple Laplacian eigenvalues and their Laplacian dynamics. Comput. Appl. Math. 42(1) (2023) - [j16]Milica Andelic, Carlos M. da Fonseca, Tamara Koledin, Zoran Stanic:
An extended eigenvalue-free interval for the eccentricity matrix of threshold graphs. J. Appl. Math. Comput. 69(1): 491-503 (2023) - 2021
- [j15]Abdullah Al-Azemi, Milica Andelic, Dragana S. Cvetkovic-Ilic:
The Moore-Penrose inverse of symmetric matrices with nontrivial equitable partitions. Appl. Math. Comput. 400: 126036 (2021) - [j14]Abdullah Al-Azemi, Milica Andelic, Aisha Salim:
On main eigenvalues of chain graphs. Comput. Appl. Math. 40(8) (2021) - [j13]Milica Andelic, Domingos M. Cardoso, Slobodan K. Simic, Zoran Stanic:
The main vertices of a star set and related graph parameters. Discret. Math. 344(12): 112593 (2021) - [j12]Milica Andelic, Tamara Koledin, Zoran Stanic:
Inequalities for Laplacian Eigenvalues of Signed Graphs with Given Frustration Number. Symmetry 13(10): 1902 (2021) - 2020
- [j11]Kinkar Chandra Das, Abdullah Al-Azemi, Milica Andelic:
On energy and Laplacian energy of chain graphs. Discret. Appl. Math. 284: 391-400 (2020) - [j10]Milica Andelic, Francesco Belardo, Zoran Stanic:
Preface. Discuss. Math. Graph Theory 40(2): 365-366 (2020) - [j9]Milica Andelic, Tamara Koledin, Zoran Stanic:
On regular signed graphs with three eigenvalues. Discuss. Math. Graph Theory 40(2): 405-416 (2020) - [j8]Milica Andelic, Maurizio Brunetti, Zoran Stanic:
Laplacian Controllability for Graphs Obtained by Some Standard Products. Graphs Comb. 36(5): 1593-1602 (2020) - [j7]Milica Andelic, Dejan Zivkovic:
Efficient Algorithm for Generating Maximal L-Reflexive Trees. Symmetry 12(5): 809 (2020)
2010 – 2019
- 2019
- [j6]Milica Andelic, Ebrahim Ghorbani, Slobodan K. Simic:
Vertex types in threshold and chain graphs. Discret. Appl. Math. 269: 159-168 (2019) - 2018
- [j5]Milica Andelic, Slobodan K. Simic, Dejan Zivkovic, E. C. Dolicanin:
Fast algorithms for computing the characteristic polynomial of threshold and chain graphs. Appl. Math. Comput. 332: 329-337 (2018) - 2015
- [j4]Milica Andelic, Domingos M. Cardoso:
Spectral Characterization of Families of Split Graphs. Graphs Comb. 31(1): 59-72 (2015) - 2013
- [j3]Milica Andelic, Carlos M. da Fonseca, Tamara Koledin, Zoran Stanic:
Sharp spectral inequalities for connected bipartite graphs with maximal Q-index. Ars Math. Contemp. 6(1): 171-185 (2013) - 2012
- [j2]Milica Andelic, Carlos M. da Fonseca, Slobodan K. Simic, Dejan V. Tosic:
Connected graphs of fixed order and size with maximal Q-index: Some spectral bounds. Discret. Appl. Math. 160(4-5): 448-459 (2012) - 2010
- [j1]Milica Andelic, Slobodan K. Simic:
Some notes on the threshold graphs. Discret. Math. 310(17-18): 2241-2248 (2010)
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-06-10 21:20 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:
