Permanent, determinant, and rank of bi-block graphs

DOI10.1007/s00010-019-00687-0zbMath1437.15008OpenAlexW2982653696WikidataQ126860931 ScholiaQ126860931MaRDI QIDQ2297337

Yanyan Li

Publication date: 18 February 2020

Published in: Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00010-019-00687-0

zbMATH Keywords

rankpermanentperfect matchingdeteminantbi-block

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (1)

Permanents of almost regular complete bipartite graphs

Uses Software

• Algorithm 447

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the determinant of bipartite graphs
• The complexity of computing the permanent
• Spektren endlicher Grafen
• On characteristic and permanent polynomials of a matrix
• Determinants of adjacency matrices of graphs
• On The Inverse Of A Class Of Bipartite Graphs With Unique Perfect Matchings
• Permanents of graphs with cut vertices
• $\mathcal{B}$-Partitions, determinant and permanent of graphs
• Determinants, Permanents and Bipartite Graphs
• Matrix permanent and quantum entanglement of permutation invariant states
• Permanents of matrices of signed ones
• On the adjacency matrix of a block graph

This page was built for publication: Permanent, determinant, and rank of bi-block graphs