On the adjacency matrix of a block graph

DOI10.1080/03081087.2013.779268zbMath1296.05118OpenAlexW2138535019MaRDI QIDQ5409967

Souvik Roy, Ravindra B. Bapat

Publication date: 15 April 2014

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081087.2013.779268

zbMATH Keywords

treeadjacency matrixdeterminantblock graphflower

Mathematics Subject Classification ID

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

Related Items (11)

A linear time algorithm for the nullity of vertex-weighted block graphs ⋮ On characteristic and permanent polynomials of a matrix ⋮ Nonsingular (vertex-weighted) block graphs ⋮ Parameterized complexity of determinant and permanent ⋮ On the spectral radius of block graphs with prescribed independence number \(\alpha\) ⋮ Nonlinear Consensus on Networks: Equilibria, Effective Resistance, and Trees of Motifs ⋮ $\mathcal{B}$-Partitions, determinant and permanent of graphs ⋮ Permanent, determinant, and rank of bi-block graphs ⋮ On the spectral radius of block graphs having all their blocks of the same size ⋮ On the Adjacency-Jacobsthal numbers ⋮ Distinguished Minimal Topological Lassos

Cites Work

• Does the lit-only restriction make any difference for the \(\sigma \)-game and \(\sigma ^+\)-game?
• An interrelation between line graphs, eigenvalues, and matroids
• On nonsingular trees and a reciprocal eigenvalue property
• Matrix Analysis
• On graphs with signed inverses
• Graphs and matrices
• On the nullity of line graphs of trees

This page was built for publication: On the adjacency matrix of a block graph