Back to Search
Start Over
Permanents of almost regular complete bipartite graphs.
- Source :
-
Linear & Multilinear Algebra . Jan2024, Vol. 72 Issue 2, p162-177. 16p. - Publication Year :
- 2024
-
Abstract
- Let G be a graph, and let $ A(G) $ A (G) be the adjacency matrix of G. The computation of permanent of $ A(G) $ A (G) is #p-complete. Computing permanent of $ A(G) $ A (G) is of great interest in quantum chemistry, statistical physics, among other disciplines. In this paper, we characterize the ordering of permanents of adjacency matrices of all graphs obtained from regular complete bipartite graph $ K_{p, p} $ K p , p by deleting six edges. As an application, we show that all graphs with a perfect matching obtained from $ K_{p, p} $ K p , p with six edges deleted are determined by their permanental polynomials. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 03081087
- Volume :
- 72
- Issue :
- 2
- Database :
- Academic Search Index
- Journal :
- Linear & Multilinear Algebra
- Publication Type :
- Academic Journal
- Accession number :
- 175363527
- Full Text :
- https://doi.org/10.1080/03081087.2022.2158169