Strong restrained domination number on trees and product of graphs: An algorithmic approach (Q6059097): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1142/s1793830922501725 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Computing the domination number of grid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restrained domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restrained domination in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4862239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming approach for various domination parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming formulation for some generalized domination parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Vertex Partitioning Problems on Partial k-Trees / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1142/S1793830922501725 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:03, 30 December 2024

scientific article; zbMATH DE number 7759222
Language Label Description Also known as
English
Strong restrained domination number on trees and product of graphs: An algorithmic approach
scientific article; zbMATH DE number 7759222

    Statements

    Strong restrained domination number on trees and product of graphs: An algorithmic approach (English)
    0 references
    0 references
    0 references
    0 references
    2 November 2023
    0 references
    restrained dominating set
    0 references
    Cartesian product
    0 references
    strong product
    0 references
    lexicographic product
    0 references

    Identifiers