2 citations · 5 across the 6 of their papers we have counts for
7 papers
Total -Uniform Graphs
Selim Bahadır, Didem Gözüpek, Oğuz Doğan
A sequence of vertices in a graph without isolated vertices is called a total dominating sequence if every vertex in the sequence has a neighbor which is adjacent to no ver…
Well-Totally-Dominated Graphs
Selim Bahadır, Tınaz Ekim, Didem Gözüpek
A subset of vertices in a graph is called a total dominating set if every vertex of the graph is adjacent to at least one vertex of this set. A total dominating set is called minim…
On Total Domination and Minimum Maximal Matchings in Graphs
Selim Bahadır
A subset of the edges of a graph is a matching if no two edges in are incident. A maximal matching is a matching that is not contained in a larger matching. A subset $S…
On a Class of Graphs with Large Total Domination Number
Selim Bahadır, Didem Gözüpek
Let and denote the domination number and the total domination number, respectively, of a graph with no isolated vertices. It is well-known that $γ_t(G) \leq 2γ(…
On the Distribution of the Number of Copies of Weakly Connected Digraphs in Random NN Digraphs
Selim Bahadır, Elvan Ceyhan
In a digraph with vertices, a minuscule construct is a subdigraph with vertices. We study the number of copies of a minuscule constructs in nearest neighbor (NN)…
A Classification of Isomorphism-Invariant Random Digraphs
Selim Bahadır, Elvan Ceyhan
We classify isomorphism-invariant random digraphs according to where randomness resides, namely, arcs, vertices, and vertices and arcs together which in turn yield arc random digra…
On the Number of Reflexive and Shared Nearest Neighbor Pairs in One-Dimensional Uniform Data
Selim Bahadır, Elvan Ceyhan
For a random sample of points in , we consider the number of pairs whose members are nearest neighbors (NN) to each other and the number of pairs sharing a common NN. T…