A bound on the k-domination number of a graph (Q3073450): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3421952 / 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: Upper bounds for \(f\)-domination number of graphs / 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: On graphs having domination number half their order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3291034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination-balanced graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new domination conception / rank
 
Normal rank
Property / cites work
 
Property / cites work: On $f$-domination number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inequalities involving independence domination, f-domination, connected and total f-domination numbers / rank
 
Normal rank

Latest revision as of 17:53, 3 July 2024

scientific article
Language Label Description Also known as
English
A bound on the k-domination number of a graph
scientific article

    Statements

    Identifiers