Document Type
Article
Publication Date
7-2023
Abstract
It has been an open problem to find the Moore-Penrose inverses of the incidence, Laplacian, and signless Laplacian matrices of families of graphs except trees and unicyclic graphs. Since the inverse formulas for an odd unicyclic graph and an even unicyclic graph are quite different, we consider wheel graphs as they are formed from odd or even cycles. In this article we solve the open problem for wheel graphs. This work has an interesting connection to inverses of circulant matrices.
Recommended Citation
Ipsen, J., & Mallik, S. (2023). Incidence and Laplacian matrices of wheel graphs and their inverses. American Journal of Combinatorics Research Article, 2, 1-19. https://doi.org/10.63151/amjc.v2i.9

Comments
The copy of record is available from the publisher at https://doi.org/10.63151/amjc.v2i.9. © The author(s). Released under the CC BY 4.0 International License.