The bipartite Laplacian matrix of a nonsingular tree
For a bipartite graph, the complete adjacency matrix is not necessary to display its adjacency information. In 1985, Godsil used a smaller size matrix to represent this, known as the bipartite adjacency matrix. Recently, the bipartite distance matrix of a tree with perfect matching was introduced as...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2023-08-01
|
| Series: | Special Matrices |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/spma-2023-0102 |