Note on Nordhaus-Gaddum problems for Colin de Verdiere type parameters

Simple item page
dc.contributor.authorBarrett, Wayne
dc.contributor.authorFallat, Shaun
dc.contributor.authorHall, Tracy
dc.contributor.authorHogben, Leslie
dc.date.accessioned2015-05-12T16:31:55Z
dc.date.available2015-05-12T16:31:55Z
dc.date.issued2013
dc.description.abstractWe 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.authorstatusFacultyen_US
dc.description.peerreviewyesen_US
dc.description.sponsorshipNSERCen_US
dc.identifier.urihttps://hdl.handle.net/10294/5683
dc.language.isoenen_US
dc.publisherPublic Knowledge Networken_US
dc.subjectmaximum nullityen_US
dc.subjectgraph complement conjectureen_US
dc.titleNote on Nordhaus-Gaddum problems for Colin de Verdiere type parametersen_US
dc.typeArticleen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
EJC-NG-paper.pdf
Size:
265.78 KB
Format:
Adobe Portable Document Format
Description:
main article
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
2.24 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Shaun Fallat