178
Views
0
CrossRef citations to date
0
Altmetric
Research Article

Matrix tree theorem for the net Laplacian matrix of a signed graph

ORCID Icon
Pages 1138-1152 | Received 24 Jun 2022, Accepted 12 Nov 2022, Published online: 31 Jan 2023

References

  • Belardo F, Simić SK. On the Laplacian coefficients of signed graphs. Linear Algebra Appl. 2015;475:94–113.
  • Belardo F, Stanić Z, Zaslavsky T. Total graph of a signed graph. Ars Math Contemporanea. 2023;23:#P1.02.
  • Zaslavsky T. Matrices in the theory of signed simple graphs. In: Acharya BD, Katona GOH, Nesetril J, editors. Advances in Discrete Mathematics and Applications: Mysore. Mysore, India: Ramanujan Math. Soc.; 2010. p. 207–229.
  • Gao H, Ji Z, Hou T. Equitable partitions in the controllability of undirected signed graphs. 2018 IEEE 14th International Conference on Control and Automation (ICCA). Anchorage, AK, USA; 2018. p. 532–537.
  • Stanić Z. On the spectrum of the net Laplacian matrix of a signed graph. Bull Math Soc Sci Math Roumanie Tome. 2020;63(111):205–213.
  • Cvetković D, Rowlinson P, Simić SK. Signless Laplacians of finite graphs. Linear Algebra Appl. 2007;423:155–171.
  • Hassani Monfared K, Mallik S. An analog of matrix tree theorem for signless Laplacians. Linear Algebra Appl. 2019;560:43–55.
  • Hessert R, Mallik S. Moore-Penrose inverses of the signless Laplacian and edge-Laplacian of graphs. Discrete Math. 2021;344:112451.
  • Hessert R, Mallik S. The inverse of the incidence matrix of a unicyclic graph. Linear Multilinear Algebra. 2022. doi:10.1080/03081087.2022.2035307.
  • Ipsen J, Mallik S. Incidence and Laplacian matrices of wheel graphs and their inverses, arXiv:2201.02579.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.