Selim Bahadır

activity

20162020

most citedOn a Class of Graphs with Large Total Domination Number

2 citations · 5 across the 6 of their papers we have counts for

collaborators

Showing math.PRShow all

2 papers · 1 filter

math.PR2016★ 1 cited

On the Distribution of the Number of Copies of Weakly Connected Digraphs in Random $k$ NN Digraphs

Selim Bahadır, Elvan Ceyhan

In a digraph with $n$ vertices, a minuscule construct is a subdigraph with $m << n$ vertices. We study the number of copies of a minuscule constructs in $k$ nearest neighbor ( $k$ NN)…

math.PR2016★ 1 cited

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 $R$ , 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…

On the Distribution of the Number of Copies of Weakly Connected Digraphs in Random kNN Digraphs

On the Number of Reflexive and Shared Nearest Neighbor Pairs in One-Dimensional Uniform Data

On the Distribution of the Number of Copies of Weakly Connected Digraphs in Random $k$ NN Digraphs