Given a graph G and a real number alpha is an element of[0, 1], Nikiforov (2017) proposed the A(alpha)-matrix of Gas A(alpha)(G) = alpha D(G) +(1 - alpha) A( G), where A(G) and D( G) are the adjacency matrix and the degree diagonal matrix of G, respectively. The largest eigenvalue of A(alpha)(G), written as lambda(alpha)(G), is called the A alpha-index of G. A set of cycles in a graph G is called independent if no two cycles in it have a common vertex in G. For n > 2k - 1, let S-n,S- 2k-1 be the join of a clique on 2k - 1vertices with an independent set of n - (2k - 1) vertices. The famous Erd...
