Generalized matrix tree theorem for mixed graphs

From MaRDI portal
Revision as of 16:28, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3836208

DOI10.1080/03081089908818623zbMath0940.05042OpenAlexW2007901221MaRDI QIDQ3836208

Jerrold W. Grossman, Devadatta M. Kulkarni, Ravindra B. Bapat

Publication date: 6 December 1999

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

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




Related Items (38)

Principal Minors of Hermitian (Quasi-)Laplacian Matrix of Second Kind for Mixed GraphsExtremizing first eigenvalue of 3-colored digraphs made with given blocksOn cospectral oriented graphs and cospectral signed graphsInverses of non-bipartite unicyclic graphs with a unique perfect matchingOn the spectrum of 3-coloured digraphsNonsingular mixed graphs with few eigenvalues greater than twoOn the determinant of the Laplacian matrix of a complex unit gain graphSome families of integral mixed graphsSpectral integral variation and unicyclic 3-colored digraphs with second smallest eigenvalue 1More on minors of Hermitian (quasi-)Laplacian matrix of the second kind for mixed graphsOn spectral invariants of the \(\alpha\)-mixed adjacency matrixMaximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given orderOn minors of the compound matrix of a LaplacianOn spectral integral variations of mixed graphsLine star sets for Laplacian eigenvaluesOn weighted directed graphsMinors of Hermitian (quasi-) Laplacian matrix of a mixed graphOn edge singularity and eigenvectors of mixed graphsUnoriented Laplacian maximizing graphs are degree maximalSingularity of Hermitian (quasi-)Laplacian matrix of mixed graphsPrincipal minor version of matrix-tree theorem for mixed graphsThe Laplacian spectrum of a mixed graphLargest eigenvalue of a unicyclic mixed graphsIdentities for minors of the Laplacian, resistance and distance matricesOn Rayleigh-Ritz ratios of a generalized Laplacian matrix of directed graphsMaximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivityOn the maximal signless Laplacian spectral radius of graphs with given matching numberOn eigenvectors of mixed graphs with exactly one nonsingular cycleAlgebraic connectivity of directed graphsMatrices with zero row sums, tree theorems and a Markov chain on treesFirst eigenvalue and first eigenvectors of a nonsingular unicyclic mixed graphSkewed converse and Laplacian spectral radius of weighted directed graphsUnnamed ItemDistance matrix and Laplacian of a tree with attached graphsEdge version of the matrix tree theorem for treesForest matrices around the Laplacian matrixThe Laplacian eigenvalues of mixed graphsFirst eigenvalue of nonsingular mixed graphs with given number of pendant vertices



Cites Work


This page was built for publication: Generalized matrix tree theorem for mixed graphs