Secure total domination in graphs: bounds and complexity (Q1786876): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5503336 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating sets for split and bipartite graphs / 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: Graphs of separability at most 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5461685 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering and domination in perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097062 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of selected recent results on total 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: Q4523707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure domination and secure total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Face covers and the genus problem for apex graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258215 / rank
 
Normal rank

Latest revision as of 15:45, 16 July 2024

scientific article
Language Label Description Also known as
English
Secure total domination in graphs: bounds and complexity
scientific article

    Statements

    Secure total domination in graphs: bounds and complexity (English)
    0 references
    0 references
    25 September 2018
    0 references
    secure total dominating set
    0 references
    secure total domination number
    0 references
    computational complexity
    0 references
    approximation algorithms
    0 references

    Identifiers