Algorithmic aspects of total Roman ${2}$-domination in graphs (Q6101489): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
label / enlabel / en
 
Algorithmic aspects of total Roman ${2}$-domination in graphs
Property / DOI
 
Property / DOI: 10.22049/cco.2021.27063.1189 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: http://comb-opt.azaruniv.ac.ir/article_14264.html / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3178084733 / rank
 
Normal rank
Property / title
 
Algorithmic aspects of total Roman ${2}$-domination in graphs (English)
Property / title: Algorithmic aspects of total Roman ${2}$-domination in graphs (English) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further progress on the total Roman \(\{2\}\)-domination number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total Roman \(\{2\}\)-dominating functions in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some APX-completeness results for cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Roman \(\{2 \}\)-domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation hardness of dominating set problems in bounded degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic aspects of semitotal domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total Domination in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold graphs and related topics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Roman {2}-domination and the double Roman domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic aspects of \(b\)-disjunctive domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees with equal Roman {2}-domination number and independent Roman {2}-domination number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-and edge-deletion NP-complete problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.22049/CCO.2021.27063.1189 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:27, 30 December 2024

scientific article; zbMATH DE number 7690961
Language Label Description Also known as
English
Algorithmic aspects of total Roman ${2}$-domination in graphs
scientific article; zbMATH DE number 7690961

    Statements

    1 June 2023
    0 references
    Roman \(\{2\}\)-dominating function
    0 references
    total Roman \(\{2\}\)-domination
    0 references
    APX-completeness
    0 references
    Algorithmic aspects of total Roman ${2}$-domination in graphs (English)
    0 references

    Identifiers