Note on Nordhaus-Gaddum problems for Colin de Verdière type parameters (Q396902): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / review text
 
Summary: We establish the bounds \(\frac 4 3 \leq b_\nu \leq b_\xi\leq \sqrt 2\), where \(b_\nu\) and \(b_\xi\) are the Nordhaus-Gaddum sum upper bound multipliers, i.e., \(\nu(G)+\nu(\overline{G})\leq b_\nu |G|\) and \(\xi(G)+\xi(\overline{G})\leq b_\xi | G|\) for all graphs \(G\), and \(\nu\) and \(\xi\) are Colin de Verdiere type graph parameters. The Nordhaus-Gaddum sum lower bound for \(\nu\) and \(\xi\) 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.
Property / review text: Summary: We establish the bounds \(\frac 4 3 \leq b_\nu \leq b_\xi\leq \sqrt 2\), where \(b_\nu\) and \(b_\xi\) are the Nordhaus-Gaddum sum upper bound multipliers, i.e., \(\nu(G)+\nu(\overline{G})\leq b_\nu |G|\) and \(\xi(G)+\xi(\overline{G})\leq b_\xi | G|\) for all graphs \(G\), and \(\nu\) and \(\xi\) are Colin de Verdiere type graph parameters. The Nordhaus-Gaddum sum lower bound for \(\nu\) and \(\xi\) 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. / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C50 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C40 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C83 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 15A03 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 15B57 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6330328 / rank
 
Normal rank
Property / zbMATH Keywords
 
Nordhaus-Gaddum problem
Property / zbMATH Keywords: Nordhaus-Gaddum problem / rank
 
Normal rank
Property / zbMATH Keywords
 
Colin de Verdière-type parameter
Property / zbMATH Keywords: Colin de Verdière-type parameter / rank
 
Normal rank
Property / zbMATH Keywords
 
graph complement conjecture
Property / zbMATH Keywords: graph complement conjecture / rank
 
Normal rank
Property / zbMATH Keywords
 
maximum nullity
Property / zbMATH Keywords: maximum nullity / rank
 
Normal rank
Property / zbMATH Keywords
 
minimum rank
Property / zbMATH Keywords: minimum rank / rank
 
Normal rank

Revision as of 15:29, 29 June 2023

scientific article
Language Label Description Also known as
English
Note on Nordhaus-Gaddum problems for Colin de Verdière type parameters
scientific article

    Statements

    Note on Nordhaus-Gaddum problems for Colin de Verdière type parameters (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 August 2014
    0 references
    Summary: We establish the bounds \(\frac 4 3 \leq b_\nu \leq b_\xi\leq \sqrt 2\), where \(b_\nu\) and \(b_\xi\) are the Nordhaus-Gaddum sum upper bound multipliers, i.e., \(\nu(G)+\nu(\overline{G})\leq b_\nu |G|\) and \(\xi(G)+\xi(\overline{G})\leq b_\xi | G|\) for all graphs \(G\), and \(\nu\) and \(\xi\) are Colin de Verdiere type graph parameters. The Nordhaus-Gaddum sum lower bound for \(\nu\) and \(\xi\) 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.
    0 references
    Nordhaus-Gaddum problem
    0 references
    Colin de Verdière-type parameter
    0 references
    graph complement conjecture
    0 references
    maximum nullity
    0 references
    minimum rank
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references