arXiv subjects

Selim Bahadır

Publications and source records attributed to Selim Bahadır.

7 recordsLinked to original sources

arXiv2020

Total $k$-Uniform Graphs

A sequence of vertices in a graph $G$ without isolated vertices is called a total dominating sequence if every vertex $v$ in the sequence has a neighbor which is adjacent to no vertex preceding $v$ in the sequence, and at the end every vertex of $G$ has at least one neighbor in the sequence. Minimum and maximum lengths of a total dominating sequence is the total domination number of $G$ (denoted by $γ_t(G)$) and the Grundy total domination number of $G$ (denoted by $γ_{gr}^t(G)$), respectively. In this paper, we study graphs with equal total domination number and Grundy total domination number. For every positive integer $k$, we call $G$ a total $k$-uniform graph if $γ_t(G)=γ_{gr}^t(G)=k$. We prove that there is no total $k$-uniform graph when $k$ is odd. In addition, we present a total 4-uniform graph which stands as a counterexample for a conjecture by T. Gologranc et.al. and provide a connected total 8-uniform graph. Moreover, we prove that every total $k$-uniform, connected and false twin-free graph is regular for every even $k$. We also show that there is no total $k$-uniform chordal connected graph with $k\geq 4$ and characterize all total $k$-uniform chordal graphs.

math.CO↗

arXiv2020

Well-Totally-Dominated Graphs

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 minimal if it does not properly contain another total dominating set. In this paper, we study graphs whose all minimal total dominating sets have the same size, referred to as well-totally-dominated (WTD) graphs. We first show that WTD graphs with bounded total domination number can be recognized in polynomial time. Then we focus on WTD graphs with total domination number two. In this case, we characterize triangle-free WTD graphs and WTD graphs with packing number two, and we show that there are only finitely many planar WTD graphs with minimum degree at least three. Lastly, we show that if the minimum degree is at least three then the girth of a WTD graph is at most 12. We conclude with several open questions.

math.CO↗

arXiv2019

On Total Domination and Minimum Maximal Matchings in Graphs

A subset $M$ of the edges of a graph $G$ is a matching if no two edges in $M$ are incident. A maximal matching is a matching that is not contained in a larger matching. A subset $S$ of vertices of a graph $G$ with no isolated vertices is a total dominating set of $G$ if every vertex of $G$ is adjacent to at least one vertex in $S$. Let $μ^*(G)$ and $γ_t(G)$ be the minimum cardinalities of a maximal matching and a total dominating set in $G$, respectively. Let $δ(G)$ denote the minimum degree in graph $G$. We observe that $γ_t(G)\leq 2μ^*(G)$ when $1\leq δ(G)\leq 2$ and $γ_t(G)\leq 2μ^*(G)-δ(G)+2$ when $δ(G)\geq 3$. We show that the upper bound for the total domination number is tight for every fixed $δ(G)$. We provide a constructive characterization of graphs $G$ satisfying $γ_t(G)= 2μ^*(G)$ and a polynomial time procedure to determine whether $γ_t(G) = 2μ^*(G)$ for a graph $G$ with minimum degree two.

math.CO↗

arXiv2018

On a Class of Graphs with Large Total Domination Number

Let $γ(G)$ and $γ_t(G)$ denote the domination number and the total domination number, respectively, of a graph $G$ with no isolated vertices. It is well-known that $γ_t(G) \leq 2γ(G)$. We provide a characterization of a large family of graphs (including chordal graphs) satisfying $γ_t(G)= 2γ(G)$, strictly generalizing the results of Henning (2001) and Hou et al. (2010), and partially answering an open question of Henning (2009).

math.CO↗

arXiv2016

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

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) digraph of the data from a random point process in $\mathbb{R}^d$. Based on the asymptotic theory for functionals of point sets under homogeneous Poisson process and binomial point process, we provide a general result for the asymptotic behavior of the number of minuscule constructs and as corollaries, we obtain asymptotic results for the number of vertices with fixed indegree, the number of shared $k$NN pairs and the number of reflexive $k$NN's in a $k$NN digraph.

math.PR↗

arXiv2016

A Classification of Isomorphism-Invariant Random Digraphs

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 digraphs (ARD), vertex random digraphs (VRD) and vertex-arc random digraphs (VARD), respectively. This digraph classification can be viewed as an extension of the classification of isomorphism-invariant random graphs. We introduce randomness in the direction of the edges of a given graph and obtain direction random digraphs (DRD) as well. We classify DRDs according to which component is random in addition to the direction and study the relations of DRDs with VARDs, VRDs and ARDs. We also consider random nearest neighbor digraphs and determine their membership with respect to these digraph families.

math.CO↗

arXiv2016

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

For a random sample of points in $\mathbb{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. The first type of pairs are called reflexive NNs whereas latter type of pairs are called shared NNs. In this article, we consider the case where the random sample of size $n$ is from the uniform distribution on an interval. We denote the number of reflexive NN pairs and the number of shared NN pairs in the sample as $R_n$ and $Q_n$, respectively. We derive the exact forms of the expected value and the variance for both $R_n$ and $Q_n$, and derive a recurrence relation for $R_n$ which may also be used to compute the exact probability mass function of $R_n$. Our approach is a novel method for finding the pmf of $R_n$ and agrees with the results in literature. We also present SLLN and CLT results for both $R_n$ and $Q_n$ as $n$ goes to infinity.

math.PR↗