Incidence and Laplacian matrices of wheel graphs and their inverses
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 whe...
Saved in:
| Main Authors: | Jerad Ipsen, Sudipta Mallik |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
American Journal of Combinatorics
2023-07-01
|
| Series: | The American Journal of Combinatorics |
| Subjects: | |
| Online Access: | https://ajcombinatorics.org/ojs/index.php/AmJC/article/view/9 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Symmetrical Multidimensional Matrices and Their Inversion
by: V. S. Mukha
Published: (2024-02-01) -
An efficient second‐order neural network model for computing the Moore–Penrose inverse of matrices
by: Lin Li, et al.
Published: (2022-12-01) -
On the Seidel Laplacian spectrum of threshold graphs
by: Megha P M, et al.
Published: (2024-12-01) -
On an inequality related to the volume of a parallelepiped
by: Oskar Maria Baksalary, et al.
Published: (2024-12-01) -
A fourth-order iterative method for computing the moore-penrose inverse
by: H. Esmaeili, et al.
Published: (2017-06-01)