16 search results - page 1 / 4 » Laplacian spectral bounds for clique and independence number... |
JCT
2007
13 years 11 months ago
2007
Let G be a simple graph with n vertices and m edges. Let ω(G) and α(G) be the numbers of vertices of the largest clique and the largest independent set in G, respectively. In th...
LION
2009
Springer
14 years 5 months ago
2009
Springer
This work introduces new bounds on the clique number of graphs derived from a result due to S´os and Straus, which generalizes the Motzkin-Straus Theorem to a specific class of h...
SIAMDM
2010
13 years 6 months ago
2010
Let G be a graph with n vertices and independence number . Hadwiger's conjecture implies that G contains a clique minor of order at least n/. In 1982, Duchet and Meyniel prov...
JUCS
2007
13 years 11 months ago
2007
: In this paper, we study spectral versions of the densest subgraph problem and the largest independence subset problem. In the first part, we give an algorithm for identifying sm...
CPC
2007
13 years 11 months ago
2007
Let G be a graph with no three independent vertices. How many edges of G can be packed with edge-disjoint copies of Kk? More specifically, let fk(n, m) be the largest integer t s...