Let G be a graph. The Laplacian matrix L(G)=D(G) -A)(G) is the difference of the diagonal matrix of vertex degrees and the O-1 adjacency matrix. Various aspects of the spectrum of L (G) are investigated. Particular attention is given to multiplicities of integer eigenvalues and to the effect on the spectrum of various modifications of G
In [E.R. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Ap...
Let G be a graph with vertex set V = {v1,v2,..., vp}, A(G) is adjacency matrix of G and D(G) is diag...
Let G be a finite simple graph with vertex set V(G) = {v1, v2, v3, …, vn} and edge set E(G). The adj...
AbstractLet G = (V, E) be a simple graph. Denote by D(G) the diagonal matrix of its vertexdegrees an...
AbstractLet G be a simple graph on n vertices, and let L be the Laplacian matrix of G. We point out ...
Let G be a simple graph of order n. The matrix ℒG=DG−AG is called the Laplacian matrix of G, where D...
AbstractLet G be a graph on n vertices. Its Laplacian matrix is the n-by-n matrix L(G)D(G)−A(G), wh...
To any graph we may associate a matrix which records information about its structure. The goal of sp...
AbstractIn [E.R. van Dam, W.H. Haemers, Which graphs are determined by their spectrum? Linear Algebr...
bra Appl. 373 (2003), 241-272] we gave a survey of answers to the question of which graphs are deter...
AbstractLet G be a graph, its Laplacian matrix is the difference of the diagonal matrix of its verte...
In [E.R. van Dam, W.H. Haemers, Which graphs are determined by their spectrum? Linear Algebra Appl. ...
Given a graph we can associate several matrices which record information about vertices and how they...
AbstractWe investigate how the spectrum of the normalized (geometric) graph Laplacian is affected by...
In this BSc thesis we deal with matrix graph theory. We are interested primarily in the eigenvalues ...
In [E.R. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Ap...
Let G be a graph with vertex set V = {v1,v2,..., vp}, A(G) is adjacency matrix of G and D(G) is diag...
Let G be a finite simple graph with vertex set V(G) = {v1, v2, v3, …, vn} and edge set E(G). The adj...
AbstractLet G = (V, E) be a simple graph. Denote by D(G) the diagonal matrix of its vertexdegrees an...
AbstractLet G be a simple graph on n vertices, and let L be the Laplacian matrix of G. We point out ...
Let G be a simple graph of order n. The matrix ℒG=DG−AG is called the Laplacian matrix of G, where D...
AbstractLet G be a graph on n vertices. Its Laplacian matrix is the n-by-n matrix L(G)D(G)−A(G), wh...
To any graph we may associate a matrix which records information about its structure. The goal of sp...
AbstractIn [E.R. van Dam, W.H. Haemers, Which graphs are determined by their spectrum? Linear Algebr...
bra Appl. 373 (2003), 241-272] we gave a survey of answers to the question of which graphs are deter...
AbstractLet G be a graph, its Laplacian matrix is the difference of the diagonal matrix of its verte...
In [E.R. van Dam, W.H. Haemers, Which graphs are determined by their spectrum? Linear Algebra Appl. ...
Given a graph we can associate several matrices which record information about vertices and how they...
AbstractWe investigate how the spectrum of the normalized (geometric) graph Laplacian is affected by...
In this BSc thesis we deal with matrix graph theory. We are interested primarily in the eigenvalues ...
In [E.R. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Ap...
Let G be a graph with vertex set V = {v1,v2,..., vp}, A(G) is adjacency matrix of G and D(G) is diag...
Let G be a finite simple graph with vertex set V(G) = {v1, v2, v3, …, vn} and edge set E(G). The adj...
DOI
Add to ORKG