A note on eigenvalue bounds for independence numbers of non-regular graphs
نویسندگان
چکیده
منابع مشابه
A note on the largest eigenvalue of non-regular graphs
The spectral radius of connected non-regular graphs is considered. Let λ1 be the largest eigenvalue of the adjacency matrix of a graph G on n vertices with maximum degree ∆. By studying the λ1-extremal graphs, it is proved that if G is non-regular and connected, then ∆− λ1 > ∆+ 1 n(3n+∆− 8) . This improves the recent results by B.L. Liu et al. AMS subject classifications. 05C50, 15A48.
متن کاملA note on domination and independence-domination numbers of graphs∗
Vizing’s conjecture is true for graphs G satisfying γ(G) = γ(G), where γ(G) is the domination number of a graph G and γ(G) is the independence-domination number of G, that is, the maximum, over all independent sets I in G, of the minimum number of vertices needed to dominate I . The equality γ(G) = γ(G) is known to hold for all chordal graphs and for chordless cycles of length 0 (mod 3). We pro...
متن کاملEla a Note on the Largest Eigenvalue of Non-regular Graphs∗
∗Received by the editors November 21, 2007. Accepted for publication February 15, 2008. Handling Editor: Stephen J. Kirkland. †School of Mathematics Sciences, South China Normal University, Guangzhou, 510631, P.R. China ([email protected], [email protected]). This work was supported by the National Natural Science Foundation of China (No.10771080) and by DF of the Ministry of Education of China...
متن کاملA Note on Edge Isoperimetric Numbers and Regular Graphs
This note resolves an open problem asked by Bezrukov in the open problem session of IWOCA 2014. It shows an equivalence between regular graphs and graphs for which a sequence of invariants presents some symmetric property. We extend this result to a few other sequences.
متن کاملSpectral bounds for the clique and independence numbers of graphs
We obtain a sequence k,(G) Q k,(G) < *. . < k,(G) of lower bounds for the clique number (size of the largest clique) of a graph G of n vertices. The bounds involve the spectrum of the adjacency matrix of G. The bound k,(G) is explicit and improves earlier known theorems. The bound k,(G) is also explicit, and is shown to improve on the bound from Brooks’ theorem even for regular graphs. The boun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2014
ISSN: 0166-218X
DOI: 10.1016/j.dam.2014.04.008