Pages that link to "Item:Q5409967"
From MaRDI portal
The following pages link to On the adjacency matrix of a block graph (Q5409967):
Displaying 19 items.
- A Perron-Frobenius theory for block matrices associated to a multiplex network (Q728350) (← links)
- Graph-theoretically determined Jordan-block-size structure of regular matrix pencils (Q1368775) (← links)
- A block negacyclic Bush-type Hadamard matrix and two strongly regular graphs (Q1601425) (← links)
- On characteristic and permanent polynomials of a matrix (Q1678984) (← links)
- On the spectral radius of block graphs having all their blocks of the same size (Q2052182) (← links)
- A linear time algorithm for the nullity of vertex-weighted block graphs (Q2161234) (← links)
- Nonsingular (vertex-weighted) block graphs (Q2185844) (← links)
- Parameterized complexity of determinant and permanent (Q2207496) (← links)
- On the spectral radius of block graphs with prescribed independence number \(\alpha\) (Q2229475) (← links)
- Permanent, determinant, and rank of bi-block graphs (Q2297337) (← links)
- Graph complexity and the laplacian matrix in blocked experiments (Q3199446) (← links)
- (Q3506118) (← links)
- $\mathcal{B}$-Partitions, determinant and permanent of graphs (Q5135465) (← links)
- Nonlinear Consensus on Networks: Equilibria, Effective Resistance, and Trees of Motifs (Q5164891) (← links)
- On the Adjacency-Jacobsthal numbers (Q5231241) (← links)
- Distinguished Minimal Topological Lassos (Q5265017) (← links)
- Block transitivity and degree matrices (Q5899391) (← links)
- A \(q\)-analogue of distance matrix of block graphs (Q6107826) (← links)
- A note proving the nullity of block graphs is unbounded (Q6646411) (← links)
