The bipartite Laplacian matrix of a nonsingular tree
The bipartite Laplacian matrix of a nonsingular tree
Abstract 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 a concept …