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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(8 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2016.01.040 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C69 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6575688 / rank
 
Normal rank
Property / zbMATH Keywords
 
degree sequence
Property / zbMATH Keywords: degree sequence / rank
 
Normal rank
Property / zbMATH Keywords
 
realization
Property / zbMATH Keywords: realization / rank
 
Normal rank
Property / zbMATH Keywords
 
forest realization
Property / zbMATH Keywords: forest realization / rank
 
Normal rank
Property / zbMATH Keywords
 
clique
Property / zbMATH Keywords: clique / rank
 
Normal rank
Property / zbMATH Keywords
 
independent set
Property / zbMATH Keywords: independent set / rank
 
Normal rank
Property / zbMATH Keywords
 
dominating set
Property / zbMATH Keywords: dominating set / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1897792189 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1507.04650 / rank
 
Normal rank
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
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2016.01.040 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:16, 9 December 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