Milan Bašić

Dr. Milan Bašić

orcid

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 March 2012 in Quantum Information Processing
Verified
Journal Article
Closed access
PDF file
MBMilan Bašić
Milan Bašić

1 January 2015 in Filomat
Verified
Journal Article
Open access
PDF file
MBMilan Bašić
Milan Bašić
AIAleksandar Ilic
Aleksandar Ilic
The unitary Cayley graph Xn has the vertex set Zn = {0,1,2,..., n-1} and vertices a and b are adjacent, if and only if gcd(a-b,n) = 1. In this paper, we present some properties of the clique, independence and distance polynomials of the unitary Cayley graphs and generalize some of the results from [W. Klotz, T. Sander, Some properties of unitary Cayley graphs, Electr. J. Comb. 14 (2007), #R45]. In addition, using some properties of Laplacian polynomial we determine the number of minimal spanning trees of any unitary Cayley graph.

22 July 2022 in Information Sciences
Verified
Journal Article
Closed access
MBMilan Bašić
Milan Bašić
BABranko Arsić
Branko Arsić
ZOZoran Obradović
Zoran Obradović

1 January 2022 in Applicable Analysis and Discrete Mathematics
Verified
Journal Article
Open access
PDF file
MBMilan Bašić
Milan Bašić
The integral circulant graph ICGn(D) has the vertex set Zn = {0, 1, 2, . . . , n? 1} and vertices a and b are adjacent if gcd(a ? b, n) ? D, where D ? Dn, Dn = {d : d | n, 1 ? d < n}. Motivated by the incorrect proof of a previously published result, in this paper we characterize the class of integral circulant graphs that are strongly regular. More precisely, connected ICGn(D) is strongly regular if and only if n is composite and D = {d ? Dn | m ? d} for some m | n and n ? 1 ? m ? 2.

23 November 2023 in Discrete Applied Mathematics
Verified
Journal Article
Closed access
MBMilan Bašić
Milan Bašić

1 January 2024 in Filomat
Verified
Journal Article
Open access
PDF file
MBMilan Bašić
Milan Bašić
Aset of novel vertex-degree-based invariants was introduced by Gutman, denoted by SO1, SO2,..., SO6. These invariants were constructed through geometric reasoning based on a new graph invariant framework. Motivated by proposed open problems in [Z. Tang, Q. Li, H. Deng, Trees with Extremal Values of the Sombor-Index-Like Graph Invariants, MATCH Commun. Math. Comput. Chem. 90 (2023) 203-222], we have found the maximum values of SO5 and SO6 in the set of molecular trees with a given number of vertices, respectively, and we have found the maximum value of SO5 in a class of connected graphs.