DSpace Repository

Browsing Matematik by Subject "Disjunctive total domination; Disjunctive total bondage; Complexity; NP-completeness"

Browsing Matematik by Subject "Disjunctive total domination; Disjunctive total bondage; Complexity; NP-completeness"

Sort by: Order: Results:

  • Ciftci, Canan (ELSEVIER AMSTERDAM, 2021)
    A subset S subset of V(G) is a disjunctive total dominating set if each vertex has a neighbor in S or has at least two vertices in Sat distance two from it. The disjunctive total domination number gamma(d)(t)(G) is the ...

Search DSpace


Advanced Search

Browse

My Account