$\mathcal{B}$-Partitions, determinant and permanent of graphs

DOI10.22108/toc.2017.105288.1508zbMath1474.05325OpenAlexW2788323195MaRDI QIDQ5135465

Ranveer Singh, Ravindra B. Bapat

Publication date: 20 November 2020

Full work available at URL: https://doaj.org/article/1a020cdc0ead4a25a775d87a28caf857

zbMATH Keywords

signed graphmixed block graph\(\mathcal{B}\)-partition

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Determinants, permanents, traces, other special matrix functions (15A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Signed and weighted graphs (05C22)

Related Items (4)

On eigenvector structure of weakly balanced networks ⋮ Nonsingular (vertex-weighted) block graphs ⋮ Parameterized complexity of determinant and permanent ⋮ Permanent, determinant, and rank of bi-block graphs

Uses Software

• MathOverflow

Cites Work

• Unnamed Item
• On characteristic and permanent polynomials of a matrix
• Eigenvalues of rank-one updated matrices with some applications
• On the notion of balance of a signed graph
• Spectral criterion for cycle balance in networks
• On the adjacency matrix of a block graph

This page was built for publication: $\mathcal{B}$-Partitions, determinant and permanent of graphs