Domination, independent domination and \(k\)-independence in trees (Q2119697): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On \(k\)-independence in graphs with emphasis on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal k-independent sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-domination and \(k\)-independence in graphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ratios of some domination parameters in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination number, independent domination number and 2-independence number in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(k\)-dependent domination / 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: Independent domination in graphs: A survey and recent results / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(k\)-domination and \(j\)-independence in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of \(i\)-excellent trees / 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: A note on connected bipartite graphs having independent domination number half their order. / rank
 
Normal rank

Revision as of 11:50, 28 July 2024

scientific article
Language Label Description Also known as
English
Domination, independent domination and \(k\)-independence in trees
scientific article

    Statements

    Identifiers