Some results on the signed complete graphs

Author
Department of Mathematics, Karaj Branch, Islamic Azad University, Karaj, Iran
Abstract
Let be a signed complete graph of order whose negative edges induce a subgraph . If is a disjoint :union: of two graphs and , then we denote by . Let be the adjacency matrix of . The characteristic polynomial and eigenvalues of are called the characteristic polynomial and eigenvalues of , respectively. The index of is the largest eigenvalue of . In this paper, we study the characteristic polynomial of where is the disjoint :union: of complete graphs and is an arbitrary subgraph of Also, we compute the characteristic polynomial of for some classes of cactus graphs and provide a sharp bound for the index of .
Keywords

1. Akbari S., Dalvandi S., Heydari F., Maghasedi M., ''On the eigenvalues of signed complete graphs'', Linear Multilinear Algebra, 67 (3) (2019) 433-441.

2. Akbari S., Dalvandi S., Heydari F., Maghasedi M., ''Signed complete graphs with maximum index'', Discuss. Math. Graph Theory, 40 (2020) 393-403.

3. Aram H., Khoeelar R., Dehgardi N., ''Laplacian energy of graphs'', Mathematical Researches, 6 (4) (2020) 501-508.

4. Brouwer A.E., Haemers W.H., ''Spectra of Graphs'', Springer, New York, (2012).

5. Cvetković D‎.‎, Rowlinson P‎., Simić S.‎, ''‎An Introduction to the Theory of Graph Spectra''‎, ‎Cambridge University Press‎, ‎Cambridge, (2010).

6. Dalvandi S., Heydari F., Maghasedi M., ''Signed complete graphs with exactly m non-negative eigenvalues'', Bull. Malays. Math. Sci. Soc., 45 (2022) 2107–2122.

7. DasGupta B., Encisob G.A., Sontag E., Zhanga Y., ''Algorithmic and complexity results for decompositions of biological networks into monotone subsystems'', BioSystems, 90 (2007) 161-178.

8. Doreian P., Mrvar A., ''Partitioning signed social networks'', Social Networks, 31 (2009) 1-11.

9. Harary F., ''On the notion of balance of a signed graph'', Michigan Mathematical Journal, 2 (1953) 143-146.

10. Harary F., Lim M., Wunsch D.C., ''Signed graphs for portfolio analysis in risk management'', IMA Journal of Management Mathematics, 13 (2003) 1-10.

11. Heider F., ''Attitude and cognitive organization'', J. Psychology, 21 (1946) 107-112.

12. Kafai N., Heydari F., Jafari Rad N., Maghasedi M., ''On the signed complete graphs with maximum index'', Iran. J. Sci. Technol. Trans. A Sci., 45 (2021) 2085-2090.

13. Simić S.K., Stanić Z., ''Polynomial reconstruction of signed graphs'', Linear Algebra Appl., 501 (2016) 390-408.

14. Souri M., Heydari F., Maghasedi M., ''Maximizing the largest eigenvalues of signed unicyclic graphs'', Discrete Math. Algorithms Appl., 12 (2) (2020) 2050016.

15. Stanić Z., ''Notes on the polynomial reconstruction of signed graphs'', Bull. Malays. Math. Sci. Soc., 45 (2022) 1301-1314.

16. Yang B., Cheung W.K., Liu J., ''Community mining from signed social networks'', IEEE Transactions on Knowledge and Data Engineering, 19 (2007) 1333-1348.

17. Zaslavsky T., ''Matrices in the theory of signed simple graphs'', Advances in Discrete Mathematics and Applications, Ramanujan Math. Soc. Lect. Notes Ser., vol. 13, Ramanujan Math. Soc., Mysore, (2010) 207-229.