AbstractThe independence number α(G) of G is defined as the maximum cardinality of a set of pairwise non-adjacent vertices which is called an independent set. In this paper, we characterize the graphs which have the minimum spectral radius among all the connected graphs of order n with independence number α(G)∈1,2,n2,n2+1,n-2,n-3
In this paper, we determine the graph with maximal signless Laplacian spectral radius among all conn...
AbstractBy the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where A(G...
In this paper, we determine the maximum signless Laplacian spectral radius of all graphs which do no...
AbstractThe independence number α(G) of G is defined as the maximum cardinality of a set of pairwise...
AbstractThe independence number α(G) of G is defined as the maximum cardinality of a set of pairwise...
AbstractIn this paper, we give a complete characterization of the extremal graphs with maximal Lapla...
In this paper we study three families of graphs, one is the graphs of order <i>n</i> with connectivi...
AbstractIn this paper, we investigate the properties of the largest signless Laplacian spectral radi...
In this paper we observe that the minimal signless Laplacian spectral radius is obtained uniquely at...
Let G(n,α) be the class of block graphs on n vertices and prescribed independence number α. In this ...
This paper generalizes and unifies the existing spectral bounds on the k-independence number of a gr...
In this paper, we obtain two spectral upper bounds for the k-independence number of a graph which is...
AbstractThe Laplacian spectral radius of a graph G is the largest eigenvalue of its Laplacian matrix...
AbstractIn this paper, we characterize the graphs with maximum signless Laplacian or adjacency spect...
AbstractLet G be a simple graph with vertices v1,v2,…,vn, of degrees Δ=d1⩾d2⩾⋯⩾dn=δ, respectively. L...
In this paper, we determine the graph with maximal signless Laplacian spectral radius among all conn...
AbstractBy the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where A(G...
In this paper, we determine the maximum signless Laplacian spectral radius of all graphs which do no...
AbstractThe independence number α(G) of G is defined as the maximum cardinality of a set of pairwise...
AbstractThe independence number α(G) of G is defined as the maximum cardinality of a set of pairwise...
AbstractIn this paper, we give a complete characterization of the extremal graphs with maximal Lapla...
In this paper we study three families of graphs, one is the graphs of order <i>n</i> with connectivi...
AbstractIn this paper, we investigate the properties of the largest signless Laplacian spectral radi...
In this paper we observe that the minimal signless Laplacian spectral radius is obtained uniquely at...
Let G(n,α) be the class of block graphs on n vertices and prescribed independence number α. In this ...
This paper generalizes and unifies the existing spectral bounds on the k-independence number of a gr...
In this paper, we obtain two spectral upper bounds for the k-independence number of a graph which is...
AbstractThe Laplacian spectral radius of a graph G is the largest eigenvalue of its Laplacian matrix...
AbstractIn this paper, we characterize the graphs with maximum signless Laplacian or adjacency spect...
AbstractLet G be a simple graph with vertices v1,v2,…,vn, of degrees Δ=d1⩾d2⩾⋯⩾dn=δ, respectively. L...
In this paper, we determine the graph with maximal signless Laplacian spectral radius among all conn...
AbstractBy the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where A(G...
In this paper, we determine the maximum signless Laplacian spectral radius of all graphs which do no...
DOI
Add to ORKG