Note on Nordhaus-Gaddum problems for Colin de Verdiere type parameters
| dc.contributor.author | Barrett, Wayne | |
| dc.contributor.author | Fallat, Shaun | |
| dc.contributor.author | Hall, Tracy | |
| dc.contributor.author | Hogben, Leslie | |
| dc.date.accessioned | 2015-05-12T16:31:55Z | |
| dc.date.available | 2015-05-12T16:31:55Z | |
| dc.date.issued | 2013 | |
| dc.description.abstract | We establish the bounds 4 on the Nordhaus- Gaddum sum upper bound multipliers for all graphs G, in connections with certain Colin de Verdi ere type graph parameters. The Nordhaus-Gaddum sum lower bound is conjectured to be |G|-2, and if these parameters are replaced by the maximum nullity M(G), this bound is called the Graph Complement Conjecture in the study of minimum rank/maximum nullity problems. | en_US |
| dc.description.authorstatus | Faculty | en_US |
| dc.description.peerreview | yes | en_US |
| dc.description.sponsorship | NSERC | en_US |
| dc.identifier.uri | https://hdl.handle.net/10294/5683 | |
| dc.language.iso | en | en_US |
| dc.publisher | Public Knowledge Network | en_US |
| dc.subject | maximum nullity | en_US |
| dc.subject | graph complement conjecture | en_US |
| dc.title | Note on Nordhaus-Gaddum problems for Colin de Verdiere type parameters | en_US |
| dc.type | Article | en_US |