AbstractLet G be a graph of order n and let Λ(G,λ)=∑k=0n(-1)kckλn-k be the characteristic polynomial of its Laplacian matrix. Zhou and Gutman recently proved that among all trees of order n, the kth coefficient ck is largest when the tree is a path, and is smallest for stars. A new proof and a strengthening of this result is provided. A relation to the Wiener index is discussed
AbstractLet G be a graph; its Laplacian matrix is the difference of the diagonal matrix of its verte...
AbstractLet G be a graph of order n and let P(G,λ)=∑k=0n(-1)kckλn-k be the characteristic polynomial...
[[abstract]]Let G be a graph of order n and let View the MathML source be the characteristic polynom...
AbstractLet G be a graph of order n and let Λ(G,λ)=∑k=0n(-1)kckλn-k be the characteristic polynomial...
AbstractLet G be a graph of order n and μ(G,λ)=∑k=0n(-1)kckλn-k the Laplacian characteristic polynom...
AbstractLet ϕ(G,λ)=∑k=0n(−1)kck(G)λn−k be the characteristic polynomial of the Laplacian matrix of a...
Let G be a simple and undirected graph with Laplacian polynomial ψ(G, λ) = Σk=0n (−1)n-kck(G)λk. In ...
AbstractLet G be a simple undirected n-vertex graph with the characteristic polynomial of its Laplac...
AbstractLet G be a simple undirected graph with the characteristic polynomial of its Laplacian matri...
AbstractLet G be a simple undirected n-vertex graph with the characteristic polynomial of its Laplac...
Let G be a simple undirected n-vertex graph with the characteristic polynomial of its Laplacian matr...
AbstractLet G be a graph of order n and μ(G,λ)=∑k=0n(-1)kckλn-k the Laplacian characteristic polynom...
AbstractLi et al. [J.X. Li, W.C. Shiu, A. Chang, The number of spanning trees of a graph, Appl. Math...
AbstractLet G be a graph of order n and let P(G,x)=∑k=0n(−1)kckxn−k be the characteristic polynomial...
AbstractLet G be a simple undirected graph with the characteristic polynomial of its Laplacian matri...
AbstractLet G be a graph; its Laplacian matrix is the difference of the diagonal matrix of its verte...
AbstractLet G be a graph of order n and let P(G,λ)=∑k=0n(-1)kckλn-k be the characteristic polynomial...
[[abstract]]Let G be a graph of order n and let View the MathML source be the characteristic polynom...
AbstractLet G be a graph of order n and let Λ(G,λ)=∑k=0n(-1)kckλn-k be the characteristic polynomial...
AbstractLet G be a graph of order n and μ(G,λ)=∑k=0n(-1)kckλn-k the Laplacian characteristic polynom...
AbstractLet ϕ(G,λ)=∑k=0n(−1)kck(G)λn−k be the characteristic polynomial of the Laplacian matrix of a...
Let G be a simple and undirected graph with Laplacian polynomial ψ(G, λ) = Σk=0n (−1)n-kck(G)λk. In ...
AbstractLet G be a simple undirected n-vertex graph with the characteristic polynomial of its Laplac...
AbstractLet G be a simple undirected graph with the characteristic polynomial of its Laplacian matri...
AbstractLet G be a simple undirected n-vertex graph with the characteristic polynomial of its Laplac...
Let G be a simple undirected n-vertex graph with the characteristic polynomial of its Laplacian matr...
AbstractLet G be a graph of order n and μ(G,λ)=∑k=0n(-1)kckλn-k the Laplacian characteristic polynom...
AbstractLi et al. [J.X. Li, W.C. Shiu, A. Chang, The number of spanning trees of a graph, Appl. Math...
AbstractLet G be a graph of order n and let P(G,x)=∑k=0n(−1)kckxn−k be the characteristic polynomial...
AbstractLet G be a simple undirected graph with the characteristic polynomial of its Laplacian matri...
AbstractLet G be a graph; its Laplacian matrix is the difference of the diagonal matrix of its verte...
AbstractLet G be a graph of order n and let P(G,λ)=∑k=0n(-1)kckλn-k be the characteristic polynomial...
[[abstract]]Let G be a graph of order n and let View the MathML source be the characteristic polynom...
DOI
Add to ORKG