Incidence and Laplacian matrices of wheel graphs and their inverses
American Journal of Combinatorics · 2023
DOI: 10.63151/amjc.v2i.9 ↗Kurz gefasst
Fachartikel in der Zeitschrift American Journal of Combinatorics, 2023. Verfasst von Jerad Ipsen und 1 weiteren Autor:innen.
Abstract (Originalsprache)
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.
Zitieren
APA
Ipsen, J., & Mallik, S. (2023). Incidence and Laplacian matrices of wheel graphs and their inverses. American Journal of Combinatorics. https://doi.org/10.63151/amjc.v2i.9
Vancouver
Ipsen J, Mallik S. Incidence and Laplacian matrices of wheel graphs and their inverses. American Journal of Combinatorics. 2023. doi:10.63151/amjc.v2i.9
BibTeX
@article{Ipsen2023,
author = {Ipsen, Jerad and Mallik, Sudipta},
title = {Incidence and Laplacian matrices of wheel graphs and their inverses},
journal = {American Journal of Combinatorics},
year = {2023},
doi = {10.63151/amjc.v2i.9}
}
EUVIMED