Largest domination number and smallest independence number of forests with given degree sequence (Q277645): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3615980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds on the domination number of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the residue of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Largest domination number and smallest independence number of forests with given degree sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with equal independence and annihilation numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bound on the domination number of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the stability number of graphs computed in terms of degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941440 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3929766 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree sequences of graphs and dominance order / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short constructive proof of A.R. Rao's characterization of potentially \(K_{r+1}\)-graphic sequences / rank
 
Normal rank

Revision as of 21:17, 11 July 2024

scientific article
Language Label Description Also known as
English
Largest domination number and smallest independence number of forests with given degree sequence
scientific article

    Statements

    Largest domination number and smallest independence number of forests with given degree sequence (English)
    0 references
    0 references
    0 references
    0 references
    2 May 2016
    0 references
    degree sequence
    0 references
    realization
    0 references
    forest realization
    0 references
    clique
    0 references
    independent set
    0 references
    dominating set
    0 references

    Identifiers