AbstractA Laplacian matrix, L=(ℓij)∈Rn×n, has nonpositive off-diagonal entries and zero row sums. As a matrix associated with a weighted directed graph, it generalizes the Laplacian matrix of an ordinary graph. A standardized Laplacian matrix is a Laplacian matrix with -1n⩽ℓij⩽0 whenever j≠i. We study the spectra of Laplacian matrices and relations between Laplacian matrices and stochastic matrices. We prove that the standardized Laplacian matrices L∼ are semiconvergent. The multiplicities of 0 and 1 as the eigenvalues of L∼ are equal to the in-forest dimension of the corresponding digraph and one less than the in-forest dimension of the complementary digraph, respectively. We localize the spectra of the standardized Laplacian matrices of o...
AbstractWe study the matrices Qk of in-forests of a weighted digraph Γ and their connections with th...
A Laplacian matrix L — (lij) € Rnxn has nonpositive off-diagonal entries and zero row sums. Every no...
We survey properties of spectra of signless Laplacians of graphs and discuss possibilities for devel...
AbstractA Laplacian matrix, L=(ℓij)∈Rn×n, has nonpositive off-diagonal entries and zero row sums. As...
Let G be a simple graph of order n. The matrix ℒG=DG−AG is called the Laplacian matrix of G, where D...
To any graph we may associate a matrix which records information about its structure. The goal of sp...
Let G be a simple graph with n vertices. The characteristic polynomial det(xI − A) of a (0,1)-adjace...
[[abstract]]Some old results about spectra of partitioned matrices due to Goddard and Schneider or H...
Let G be a graph. The Laplacian matrix L(G)=D(G) -A)(G) is the difference of the diagonal matrix of ...
Let G be a finite simple graph with vertex set V(G) = {v1, v2, v3, …, vn} and edge set E(G). The adj...
AbstractWe survey properties of spectra of signless Laplacians of graphs and discuss possibilities f...
AbstractLet AG and DG be respectively the adjacency matrix and the degree matrix of a graph G. The s...
With every graph (or digraph) one can associate several different matrices. Here we shall concentrat...
We consider a finite undirected and connected simple graph ...
AbstractWe give lower bounds for the smallest eigenvalue of the Laplacian of corresponding undirecte...
AbstractWe study the matrices Qk of in-forests of a weighted digraph Γ and their connections with th...
A Laplacian matrix L — (lij) € Rnxn has nonpositive off-diagonal entries and zero row sums. Every no...
We survey properties of spectra of signless Laplacians of graphs and discuss possibilities for devel...
AbstractA Laplacian matrix, L=(ℓij)∈Rn×n, has nonpositive off-diagonal entries and zero row sums. As...
Let G be a simple graph of order n. The matrix ℒG=DG−AG is called the Laplacian matrix of G, where D...
To any graph we may associate a matrix which records information about its structure. The goal of sp...
Let G be a simple graph with n vertices. The characteristic polynomial det(xI − A) of a (0,1)-adjace...
[[abstract]]Some old results about spectra of partitioned matrices due to Goddard and Schneider or H...
Let G be a graph. The Laplacian matrix L(G)=D(G) -A)(G) is the difference of the diagonal matrix of ...
Let G be a finite simple graph with vertex set V(G) = {v1, v2, v3, …, vn} and edge set E(G). The adj...
AbstractWe survey properties of spectra of signless Laplacians of graphs and discuss possibilities f...
AbstractLet AG and DG be respectively the adjacency matrix and the degree matrix of a graph G. The s...
With every graph (or digraph) one can associate several different matrices. Here we shall concentrat...
We consider a finite undirected and connected simple graph ...
AbstractWe give lower bounds for the smallest eigenvalue of the Laplacian of corresponding undirecte...
AbstractWe study the matrices Qk of in-forests of a weighted digraph Γ and their connections with th...
A Laplacian matrix L — (lij) € Rnxn has nonpositive off-diagonal entries and zero row sums. Every no...
We survey properties of spectra of signless Laplacians of graphs and discuss possibilities for devel...