DSpace Repository

Browsing Matematik by Author "Ciftci, Canan"

Browsing Matematik by Author "Ciftci, Canan"

Sort by: Order: Results:

  • Complexity and bounds for disjunctive total bondage 
    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 ...
  • Disjunctive Total Domination In Harary Graphs 
    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 ...
  • DISJUNCTIVE TOTAL DOMINATION IN SOME GRAPHS DERIVED FROM THE SUBDIVISION GRAPH 
    Ciftci, Canan; Aytac, Aysun (TURKIC WORLD MATHEMATICAL SOC BAKU, 2021)
    For a set S subset of V (G), if every vertex has a neighbor in S or has at least two vertices in S at distance two from it, then the set S is a disjunctive total dominating set of G. The minimum cardinality of such a set ...
  • Disjunctive total domination stability in graphs 
    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 ...
  • Disjunctive Total Domination Subdivision Number of Graphs 
    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 ...
  • Exponential Independence Number of Some Graphs 
    Aytac, Aysun; Ciftci, Canan (WORLD SCIENTIFIC PUBL CO PTE LTD, 5 TOH TUCK LINK, SINGAPORE 596224, SINGAPORE, 2018)
    Let G be a graph and S subset of V(G). We define by < S > the subgraph of G induced by S. For each vertex u is an element of S and for each vertex v is an element of S\{u}, d((G, s\{u})())(u,v) is the length of the shortest ...

Search DSpace


Advanced Search

Browse

My Account