On the Lovász ϑ-number of almost regular graphs with application to Erdős–Rényi graphs
We consider k-regular graphs with loops, and study the Lovász ϑ-numbers and Schrijver ϑ′-numbers of the graphs that result when the loop edges are removed. We show that the ϑ-number dominates a recent eigenvalue upper bound on the stability number due to Godsil and Newman [C.D. Godsil and M.W. Newma...
Main Authors: | Sotirov, R., Klerk, Etienne de., Newman, M. W., Pasechnik, Dmitrii V. |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Journal Article |
Language: | English |
Published: |
2012
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/94538 http://hdl.handle.net/10220/7516 |
Similar Items
-
On the Lovász theta−number of almost regular graphs with application to Erdös−Rényi graphs
by: Klerk, E, et al.
Published: (2009) -
On approximate graph colouring and max-k-cut algorithms based on the θ-function
by: Klerk, Etienne de., et al.
Published: (2013) -
A note on the stability number of an orthogonality graph
by: Klerk, Etienne de., et al.
Published: (2011) -
Modularity of Erdos-Rényi random graphs
by: McDiarmid, C, et al.
Published: (2018) -
Shotgun assembly of Erdős-Rényi random graphs
by: Gaudio, Julia, et al.
Published: (2022)