Independence and<i>k</i>-domination in graphs (Q2995488): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/00207160.2010.482664 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2057788370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some bounds on the \(p\)-domination number in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the k-domination number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for thek-domination number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Onk-domination and minimum degree in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:25, 3 July 2024

scientific article
Language Label Description Also known as
English
Independence and<i>k</i>-domination in graphs
scientific article

    Statements

    Independence and<i>k</i>-domination in graphs (English)
    0 references
    0 references
    0 references
    0 references
    21 April 2011
    0 references
    k-domination
    0 references
    maximum independent set
    0 references

    Identifiers