On the adjacency matrix of a block graph

DOI10.1080/03081087.2013.779268zbMATH Open1296.05118OpenAlexW2138535019MaRDI QIDQ5409967FDOQ5409967

Authors: Souvik Roy, R. 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

Recommendations

• Nonsingular (vertex-weighted) block graphs
• scientific article; zbMATH DE number 2157272
• Linear time algorithm to check the singularity of block graphs
• Permanent, determinant, and rank of bi-block graphs
• Determinants of adjacency matrices of graphs

zbMATH Keywords

treeadjacency matrixdeterminantblock graphflower

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (20)

• A block negacyclic Bush-type Hadamard matrix and two strongly regular graphs
• On the spectral radius of block graphs with prescribed independence number \(\alpha\)
• Nonsingular (vertex-weighted) block graphs
• Graph-theoretically determined Jordan-block-size structure of regular matrix pencils
• A Perron-Frobenius theory for block matrices associated to a multiplex network
• Block transitivity and degree matrices
• \(\mathcal{B}\)-partitions, determinant and permanent of graphs
• A linear time algorithm for the nullity of vertex-weighted block graphs
• Linear time algorithm to check the singularity of block graphs
• On the spectral radius of block graphs having all their blocks of the same size
• Distinguished minimal topological lassos
• A note proving the nullity of block graphs is unbounded
• On characteristic and permanent polynomials of a matrix
• Title not available (Why is that?)
• A \(q\)-analogue of distance matrix of block graphs
• Graph complexity and the laplacian matrix in blocked experiments
• Permanent, determinant, and rank of bi-block graphs
• On the adjacency-Jacobsthal numbers
• Parameterized complexity of determinant and permanent
• Nonlinear consensus on networks: equilibria, effective resistance, and trees of motifs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5409967)