1 citations · 1 across the 1 of their papers we have counts for
8 papers
On some problems regarding distance-balanced graphs
Blas Fernandez, Ademir Hujdurovic
A graph is said to be distance-balanced if for any edge of , the number of vertices closer to than to is equal to the number of vertices closer to than to $…
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…
Strong cliques in vertex-transitive graphs
Ademir Hujdurovic
A clique (resp., independent set) in a graph is strong if it intersects every maximal independent sets (resp., every maximal cliques). A graph is CIS if all of its maximal cliques…
Detecting strong cliques
Ademir Hujdurović, Martin Milanič, Bernard Ries
A strong clique in a graph is a clique intersecting every maximal independent set. We study the computational complexity of six algorithmic decision problems related to strong cliq…
On Almost Well-Covered Graphs of Girth at Least 6
Tınaz Ekim, Didem Gözüpek, Ademir Hujdurović +1
We consider a relaxation of the concept of well-covered graphs, which are graphs with all maximal independent sets of the same size. The extent to which a graph fails to be well-co…
Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphs
Didem Gözüpek, Ademir Hujdurović, Martin Milanič
A graph is said to be well-dominated if all its minimal dominating sets are of the same size. The class of well-dominated graphs forms a subclass of the well studied class of well-…