Extremal digraphs with given clique number (Q2637154): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3907599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectra of digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of the conjecture of Brualdi and Li / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pick's inequality and tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral radius of strongly connected digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Inequalities for the Largest Eigenvalue of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on graph eigenvalues. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5790850 / rank
 
Normal rank

Latest revision as of 08:32, 7 July 2024

scientific article
Language Label Description Also known as
English
Extremal digraphs with given clique number
scientific article

    Statements

    Extremal digraphs with given clique number (English)
    0 references
    0 references
    0 references
    19 February 2014
    0 references
    digraph
    0 references
    clique number
    0 references
    tournament
    0 references
    characteristic polynomial
    0 references
    Perron root
    0 references

    Identifiers