THIS SITE

Information for

Algebraic Graph Theory Seminar - John SinkovicExport this event to calendar

Thursday, September 14, 2017 — 3:30 PM EDT

Title: Using eigenvalues to bound the independence number of a graph

Speaker: John  Sinkovic
Affiliation: University of Waterloo
Location: MC 6486

Abstract:

Finding a maximum independent set (or clique) in an arbitrary graph has been shown to be NP-hard.  As any independent set gives a lower bound on the independence number, determining an upper bound is usually more useful.  Two such upper bounds are the Hoffman-Delsarte bound and the Cvetković bound.  Both use the eigenvalues of a matrix associated with the graph.  

I will introduce the two bounds and share some recent results from joint work with Zach Dockstader.

Location 
MC - Mathematics & Computer Building
6486
200 University Avenue West
Waterloo, ON N2L 3G1
Canada

S M T W T F S
29
30
31
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
1
2
  1. 2017 (96)
    1. November (16)
    2. October (11)
    3. September (7)
    4. August (3)
    5. July (5)
    6. June (9)
    7. May (10)
    8. April (7)
    9. March (13)
    10. February (10)
    11. January (5)
  2. 2016 (137)
    1. December (5)
    2. November (12)
    3. October (10)
    4. September (8)
    5. August (12)
    6. July (15)
    7. June (14)
    8. May (16)
    9. April (8)
    10. March (18)
    11. February (11)
    12. January (8)
  3. 2015 (136)
  4. 2014 (88)
  5. 2013 (48)
  6. 2012 (39)
  7. 2011 (36)
  8. 2010 (40)
  9. 2009 (40)
  10. 2008 (39)
  11. 2007 (15)