Let G be a mixed graph and L(G) be the Laplacian matrix of G. In this paper, the coefficients of the Laplacian characteristic polynomial of G are studied. The first derivative of the characteristic polynomial of L(G) is explicitly expressed by means of Laplacian characteristic polynomials of its edge deleted subgraphs. As a consequence, it is shown that the Laplacian characteristic polynomial of a mixed graph is reconstructible from the collection of the Laplacian characteristic polynomials of its edge deleted subgraphs. Then, it is investigated how graph modifications affect the mixed Laplacian characteristic polynomial. Also, a connection between the Laplacian characteristic polynomial of a non-singular connected mixed graph and the signl...
In this paper, we give a geometric interpretation of the Laplacian matrix of a connected nonsingular...
Let Γ=(G,σ) be a signed graph, where G is its underlying graph and σ its sign function (defined on e...
Let Γ=(G,σ) be a signed graph, where G is its underlying graph and σ its sign function (defined on e...
AbstractIn this paper, we discuss some properties of relations between a mixed graph and its line gr...
In this paper, we discuss some properties of relations between a mixed graph and its line graph, whi...
AbstractIn this paper, we discuss some properties of relations between a mixed graph and its line gr...
summary:The Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a g...
summary:The Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a g...
AbstractIn this work we deal with the characteristic polynomial of the Laplacian of a graph. We pres...
Let G be a graph and L(G) be the Laplacian matrix of G. In this article, we first point out that the...
AbstractIn this paper, we firstly give an upper bound for the second smallest Laplacian eigenvalue o...
AbstractIn this paper, we characterize the mixed graphs with exactly one Laplacian eigenvalue moving...
Let D be a digraph with n vertices and a arcs. The Laplacian and the signless Laplacian matrices of ...
AbstractLet ϕ(G,λ)=∑k=0n(−1)kck(G)λn−k be the characteristic polynomial of the Laplacian matrix of a...
AbstractLet G be a graph of order n and let P(G,x)=∑k=0n(−1)kckxn−k be the characteristic polynomial...
In this paper, we give a geometric interpretation of the Laplacian matrix of a connected nonsingular...
Let Γ=(G,σ) be a signed graph, where G is its underlying graph and σ its sign function (defined on e...
Let Γ=(G,σ) be a signed graph, where G is its underlying graph and σ its sign function (defined on e...
AbstractIn this paper, we discuss some properties of relations between a mixed graph and its line gr...
In this paper, we discuss some properties of relations between a mixed graph and its line graph, whi...
AbstractIn this paper, we discuss some properties of relations between a mixed graph and its line gr...
summary:The Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a g...
summary:The Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a g...
AbstractIn this work we deal with the characteristic polynomial of the Laplacian of a graph. We pres...
Let G be a graph and L(G) be the Laplacian matrix of G. In this article, we first point out that the...
AbstractIn this paper, we firstly give an upper bound for the second smallest Laplacian eigenvalue o...
AbstractIn this paper, we characterize the mixed graphs with exactly one Laplacian eigenvalue moving...
Let D be a digraph with n vertices and a arcs. The Laplacian and the signless Laplacian matrices of ...
AbstractLet ϕ(G,λ)=∑k=0n(−1)kck(G)λn−k be the characteristic polynomial of the Laplacian matrix of a...
AbstractLet G be a graph of order n and let P(G,x)=∑k=0n(−1)kckxn−k be the characteristic polynomial...
In this paper, we give a geometric interpretation of the Laplacian matrix of a connected nonsingular...
Let Γ=(G,σ) be a signed graph, where G is its underlying graph and σ its sign function (defined on e...
Let Γ=(G,σ) be a signed graph, where G is its underlying graph and σ its sign function (defined on e...