On the adjacency matrix of a block graph
From MaRDI portal
Publication:5409967
Recommendations
Cites work
- An interrelation between line graphs, eigenvalues, and matroids
- Does the lit-only restriction make any difference for the \(\sigma \)-game and \(\sigma ^+\)-game?
- Graphs and matrices
- Matrix Analysis
- On graphs with signed inverses
- On nonsingular trees and a reciprocal eigenvalue property
- On the nullity of line graphs of trees
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
- 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
- On characteristic and permanent polynomials of a matrix
- scientific article; zbMATH DE number 5287649 (Why is no real title available?)
- A note proving the nullity of block graphs is unbounded
- Graph complexity and the laplacian matrix in blocked experiments
- A \(q\)-analogue of distance matrix of block graphs
- Permanent, determinant, and rank of bi-block graphs
- Parameterized complexity of determinant and permanent
- On the adjacency-Jacobsthal numbers
- 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)
