5 citations · 13 across the 10 of their papers we have counts for
5 papers · 1 filter
On k-neighbor separated permutations
István Kovács, Daniel Soltész
Two permutations of are \textit{-neighbor separated} if there are two elements that are neighbors in one of the permutations and that are separated by exa…
On groups all of whose Haar graphs are Cayley graphs
Yan-Quan Feng, Istvan Kovacs, Da-Wei Yang
A Cayley graph of a group is a finite simple graph such that contains a subgroup isomorphic to acting regularly on , while a Haar graph of is a…
Elementary abelian groups of rank 5 are DCI-groups
Yan-Quan Feng, István Kovács
In this paper, we show that the group is a DCI-group for any odd prime that is, two Cayley digraphs Cay and Cay are is…
The complexity of recognizing minimally tough graphs
Gyula Y Katona, István Kovács, Kitti Varga
A graph is called -tough if the removal of any vertex set that disconnects the graph leaves at most components. The toughness of a graph is the largest for which…
Dense point sets with many halving lines
István Kovács, Géza Tóth
A planar point set of points is called {\em -dense} if the ratio of the largest and smallest distances among the points is at most . We construct a dense set of $…