AbstractIn this paper, we present lower and upper bounds for the independence number α(G) and the clique number ω(G) involving the Laplacian eigenvalues of the graph G
AbstractLet G be a connected graph of order n. A dominating set in G is a subset S of V(G) such that...
AbstractAssume that μ1,μ2,…,μn are eigenvalues of the Laplacian matrix of a graph G. The Laplacian-e...
This paper is a survey on the upper and lower bounds for the largest eigenvalue of the Laplacian mat...
AbstractIn this paper, we present lower and upper bounds for the independence number α(G) and the cl...
summary:Lower and upper bounds are obtained for the clique number $\omega (G)$ and the independence ...
AbstractWe give some new bounds for the clique and independence numbers of a graph in terms of its e...
We give some new bounds for the clique and independence numbers of a graph in terms of its eigenvalu...
AbstractWe study the Laplacian eigenvalues of trees on n vertices with independence number α and des...
We give some new bounds for the clique and independence numbers of a graph in terms of its eigenvalu...
International Conference on Numerical Analysis and Applied Mathematics (ICNAAM) -- SEP 19-25, 2011 -...
AbstractThe independence number α(G) of G is defined as the maximum cardinality of a set of pairwise...
AbstractWe obtain a sequence k1(G) ≤ k2(G) ≤ … ≤ kn(G) of lower bounds for the clique number (size o...
We prove an upper bound for the independence number of a graph in terms of the largest Laplacian eig...
AbstractThe Laplacian spectral radius of a graph G is the largest eigenvalue of its Laplacian matrix...
AbstractIn this paper, we give a complete characterization of the extremal graphs with maximal Lapla...
AbstractLet G be a connected graph of order n. A dominating set in G is a subset S of V(G) such that...
AbstractAssume that μ1,μ2,…,μn are eigenvalues of the Laplacian matrix of a graph G. The Laplacian-e...
This paper is a survey on the upper and lower bounds for the largest eigenvalue of the Laplacian mat...
AbstractIn this paper, we present lower and upper bounds for the independence number α(G) and the cl...
summary:Lower and upper bounds are obtained for the clique number $\omega (G)$ and the independence ...
AbstractWe give some new bounds for the clique and independence numbers of a graph in terms of its e...
We give some new bounds for the clique and independence numbers of a graph in terms of its eigenvalu...
AbstractWe study the Laplacian eigenvalues of trees on n vertices with independence number α and des...
We give some new bounds for the clique and independence numbers of a graph in terms of its eigenvalu...
International Conference on Numerical Analysis and Applied Mathematics (ICNAAM) -- SEP 19-25, 2011 -...
AbstractThe independence number α(G) of G is defined as the maximum cardinality of a set of pairwise...
AbstractWe obtain a sequence k1(G) ≤ k2(G) ≤ … ≤ kn(G) of lower bounds for the clique number (size o...
We prove an upper bound for the independence number of a graph in terms of the largest Laplacian eig...
AbstractThe Laplacian spectral radius of a graph G is the largest eigenvalue of its Laplacian matrix...
AbstractIn this paper, we give a complete characterization of the extremal graphs with maximal Lapla...
AbstractLet G be a connected graph of order n. A dominating set in G is a subset S of V(G) such that...
AbstractAssume that μ1,μ2,…,μn are eigenvalues of the Laplacian matrix of a graph G. The Laplacian-e...
This paper is a survey on the upper and lower bounds for the largest eigenvalue of the Laplacian mat...
DOI
Add to ORKG