2 citations · 2 across the 3 of their papers we have counts for
7 papers
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 the Maximum Cardinality Cut Problem in Proper Interval Graphs and Related Graph Classes
Arman Boyacı, Tınaz Ekim, Mordechai Shalom
Although it has been claimed in two different papers that the maximum cardinality cut problem is polynomial-time solvable for proper interval graphs, both of them turned out to be…
Defective Ramsey Numbers in Graph Classes
Yunus Emre Demirci, Tınaz Ekim, John Gimbel +1
Given a graph , a -sparse -set is a set of vertices inducing a subgraph with maximum degree at most . A -dense -set is a set of vertices that is -spars…
The Complexity of Subtree Intersection Representation of Chordal Graphs and Linear Time Chordal Graph Generation
Tınaz Ekim, Mordechai Shalom, Oylum Şeker
It is known that any chordal graph on vertices can be represented as the intersection of subtrees in a tree on nodes. This fact is recently used in [2] to generate rand…
Well-indumatched Trees and Graphs of Bounded Girth
S. Akbari, T. Ekim, A. H. Ghodrati +1
A graph G is called well-indumatched if all of its maximal induced matchings have the same size. In this paper we characterize all well-indumatched trees. We provide a linear time…
Mind the Independence Gap
Tınaz Ekim, Didem Gözüpek, Ademir Hujdurović +1
The independence gap of a graph was introduced by Ekim et al. (2018) as a measure of how far a graph is from being well-covered. It is defined as the difference between the maximum…