Let Γ=(G,σ) be a signed graph, where G is the underlying graph and σ:E(G)→{+,-} is the signature function on the edges of G. In this paper, we consider the Laplacian eigenvalues of signed graphs and we characterize the connected signed graphs whose second largest Laplacian eigenvalue does not exceed 3. Furthermore, we study the Laplacian spectral determination of most graphs in the latter family
The Laplacian energy of a signed graph is defined as the sum of the distance of its Laplacian eigenv...
Let Γ=(G,σ) be a signed graph, where G is its underlying graph and σ its sign function (defined on e...
A signed graph is a pair (G,sigma), where G is a graph and sigma is the sign function on the edges o...
Let Γ=(G,σ) be a signed graph, where G is the underlying graph and σ:E(G)→{+,-} is the signature fun...
In this paper, we established a connection between the Laplacian eigenvalues of a signed graph and t...
AbstractIn this paper, we first give an upper bound for the largest signless Laplacian eigenvalue of...
A signed graph is a pair Γ = (G, σ), where G = (V (G), E(G))is a graph and σ : E(G) → {+, −} is the ...
In this paper, we consider the signless Laplacians of simple graphs and we give some eigenvalue ineq...
Abstract. We extend our previous survey of properties of spectra of signless Laplacians of graphs. S...
Let Γ=(G,σ) be a connected signed graph, where G is the underlying simple graph and σ:E(G)→{1,−1} is...
AbstractWe study extremal graphs for the extremal values of the second largest Q-eigenvalue of a con...
In this paper we consider the graphs having at most two (signless) Laplacian eigenvalues greater tha...
AbstractLet G be a simple connected graph with n vertices and m edges. Denote the degree of vertex v...
A signed graph is a pair (G,sigma), where G is a graph and sigma is the sign function on the edges o...
The join of two disjoint graphs G and H, denoted by G ∨ H, is the graph obtained by joining each ver...
The Laplacian energy of a signed graph is defined as the sum of the distance of its Laplacian eigenv...
Let Γ=(G,σ) be a signed graph, where G is its underlying graph and σ its sign function (defined on e...
A signed graph is a pair (G,sigma), where G is a graph and sigma is the sign function on the edges o...
Let Γ=(G,σ) be a signed graph, where G is the underlying graph and σ:E(G)→{+,-} is the signature fun...
In this paper, we established a connection between the Laplacian eigenvalues of a signed graph and t...
AbstractIn this paper, we first give an upper bound for the largest signless Laplacian eigenvalue of...
A signed graph is a pair Γ = (G, σ), where G = (V (G), E(G))is a graph and σ : E(G) → {+, −} is the ...
In this paper, we consider the signless Laplacians of simple graphs and we give some eigenvalue ineq...
Abstract. We extend our previous survey of properties of spectra of signless Laplacians of graphs. S...
Let Γ=(G,σ) be a connected signed graph, where G is the underlying simple graph and σ:E(G)→{1,−1} is...
AbstractWe study extremal graphs for the extremal values of the second largest Q-eigenvalue of a con...
In this paper we consider the graphs having at most two (signless) Laplacian eigenvalues greater tha...
AbstractLet G be a simple connected graph with n vertices and m edges. Denote the degree of vertex v...
A signed graph is a pair (G,sigma), where G is a graph and sigma is the sign function on the edges o...
The join of two disjoint graphs G and H, denoted by G ∨ H, is the graph obtained by joining each ver...
The Laplacian energy of a signed graph is defined as the sum of the distance of its Laplacian eigenv...
Let Γ=(G,σ) be a signed graph, where G is its underlying graph and σ its sign function (defined on e...
A signed graph is a pair (G,sigma), where G is a graph and sigma is the sign function on the edges o...