DSpace Repository

Browsing Matematik by Author "0000-0001-5397-0367"

Browsing Matematik by Author "0000-0001-5397-0367"

Sort by: Order: Results:

  • Ciftci, Canan; Aytac, Vecdi (OXFORD UNIV PRESS-OXFORD, 2023)
    Let G be a graph. A set S of vertices in G is a disjunctive total dominating set of G if every vertex is adjacent to a vertex of S or has at least two vertices in S at distance two from it. The disjunctive total domination ...
  • Ciftci, Canan (WILEY, 111 RIVER ST, HOBOKEN 07030-5774, NJ USA, 2020)
    A setS subset of V(G) is a disjunctive total dominating set ofGif every vertex has a neighbor inSor has at least two vertices inSat distance two from it. The minimum cardinality of such a set is equal to the disjunctive ...
  • Aytac, Vecdi; Ciftci, Canan (IOS PRESS, NIEUWE HEMWEG 6B, 1013 BG AMSTERDAM, NETHERLANDS, 2020)
    A set S subset of V (G) is a disjunctive total dominating set of G if every vertex has a neighbor in S or has at least two vertices in S at distance 2 from it. The disjunctive total domination number is the minimum cardinality ...
  • Aytac, A.; Ciftci, C. (MAIK NAUKA/INTERPERIODICA/SPRINGER, 233 SPRING ST, NEW YORK, NY 10013-1578 USA, 2020)
    A porous exponential dominating set of a graph G is a subset S such that, for every vertex v of G, n-ary sumation (u is an element of S)(1/2)(d(u, v)-1) >= l, where d(u, v) is the distance between vertices u and v. The ...
  • Aytac, Aysun; ciftci, Canan (WILEY, 111 RIVER ST, HOBOKEN 07030-5774, NJ USA, 2020)
    Let G be a graph and S subset of V(G). If n-ary sumation u is an element of S12d(u,v)-1 >= 1 for all v is an element of V(G), then S is a porous exponential dominating set for G, where d(u, v) is the distance between ...

Search DSpace


Advanced Search

Browse

My Account