33 search results - page 1 / 7 » Cliques and the spectral radius |
JCT
2007
13 years 4 months ago
2007
We prove a number of relations between the number of cliques of a graph G and the largest eigenvalue (G) of its adjacency matrix. In particular, writing ks (G) for the number of s...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
It is well known that the spectral radius of a tree whose maximum degree is ∆ cannot exceed 2 √
JCT
2007
13 years 4 months ago
2007
We study the spectral radius of connected non-regular graphs. Let λ1(n,Δ) be the maximum spectral radius among all connected non-regular graphs with n vertices and maximum degre...
SWAT
1994
Springer
13 years 9 months ago
1994
Springer
A graph is distance-hereditary if and only if each cycle on five or more vertices has at least two crossing chords. We present linear time algorithms for the minimum r-dominating c...
JCT
2007
13 years 4 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...