AbstractLetGrmndenote the set of simple graphs withnvertices andmedges,t(G)the number of spanning trees of a graphG,andL(λ,G)the Laplacian polynomial ofG.We give some operationsQon graphs such that ifG∈GrmnthenQ(G)∈GrmnandL(λ, G)≤L(λ,Q(G))forλ≤n.Because of the relationt(Ks\E(Gn)) =srs-n-2L(s,Gn) [5],these operations also increase the number of spanning trees of the corresponding complement graphs:t(Ks\E(G)) ≤ t(Ks\E(Q(G)).The approach developed can be used to find some other graph operations with the same property
AbstractFor a connected simple graph G let L(G) denote the maximum number of leaves in any spanning ...
As a generalization of the Sierpiński-like graphs, the subdivided-line graph Г(G) of a simple connec...
AbstractThe problem of comparison of graphs with the same number of vertices and edges by their numb...
AbstractLetGrmndenote the set of simple graphs withnvertices andmedges,t(G)the number of spanning tr...
AbstractThe problem of comparison of graphs with the same number of vertices and edges by their numb...
AbstractLi et al. [J.X. Li, W.C. Shiu, A. Chang, The number of spanning trees of a graph, Appl. Math...
AbstractThe polynomial we consider here is the characteristic polynomial of a certain (not adjacency...
International audienceIf G is a strongly connected finite directed graph, the set T G of rooted dire...
AbstractIn this paper we study the number of spanning forests of a graph. Let G be a connected simpl...
International audienceIf G is a strongly connected finite directed graph, the set T G of rooted dire...
AbstractIn this paper we study the Laplacian spectra, the Laplacian polynomials, and the number of s...
AbstractLi et al. [J.X. Li, W.C. Shiu, A. Chang, The number of spanning trees of a graph, Appl. Math...
International audienceIf G is a strongly connected finite directed graph, the set T G of rooted dire...
AbstractIn this paper, we present some sharp upper bounds for the number of spanning trees of a conn...
AbstractIn this paper we study the Laplacian spectra, the Laplacian polynomials, and the number of s...
AbstractFor a connected simple graph G let L(G) denote the maximum number of leaves in any spanning ...
As a generalization of the Sierpiński-like graphs, the subdivided-line graph Г(G) of a simple connec...
AbstractThe problem of comparison of graphs with the same number of vertices and edges by their numb...
AbstractLetGrmndenote the set of simple graphs withnvertices andmedges,t(G)the number of spanning tr...
AbstractThe problem of comparison of graphs with the same number of vertices and edges by their numb...
AbstractLi et al. [J.X. Li, W.C. Shiu, A. Chang, The number of spanning trees of a graph, Appl. Math...
AbstractThe polynomial we consider here is the characteristic polynomial of a certain (not adjacency...
International audienceIf G is a strongly connected finite directed graph, the set T G of rooted dire...
AbstractIn this paper we study the number of spanning forests of a graph. Let G be a connected simpl...
International audienceIf G is a strongly connected finite directed graph, the set T G of rooted dire...
AbstractIn this paper we study the Laplacian spectra, the Laplacian polynomials, and the number of s...
AbstractLi et al. [J.X. Li, W.C. Shiu, A. Chang, The number of spanning trees of a graph, Appl. Math...
International audienceIf G is a strongly connected finite directed graph, the set T G of rooted dire...
AbstractIn this paper, we present some sharp upper bounds for the number of spanning trees of a conn...
AbstractIn this paper we study the Laplacian spectra, the Laplacian polynomials, and the number of s...
AbstractFor a connected simple graph G let L(G) denote the maximum number of leaves in any spanning ...
As a generalization of the Sierpiński-like graphs, the subdivided-line graph Г(G) of a simple connec...
AbstractThe problem of comparison of graphs with the same number of vertices and edges by their numb...