research
∙
04/03/2023
Variety of mutual-visibility problems in graphs
If X is a subset of vertices of a graph G, then vertices u and v are X-v...
share
research
∙
10/27/2022
Geodesic packing in graphs
Given a graph G, a geodesic packing in G is a set of vertex-disjoint max...
research
∙
10/23/2022
The geodesic cover problem for butterfly networks
A geodesic cover, also known as an isometric path cover, of a graph is a...
research
∙
05/07/2022
The general position avoidance game and hardness of general position games
Given a graph G, a set S of vertices in G is a general position set if n...
research
∙
12/02/2021
On the computational complexity of the Steiner k-eccentricity
The Steiner k-eccentricity of a vertex v of a graph G is the maximum Ste...
research
∙
06/14/2019
On the Djoković-Winkler relation and its closure in subdivisions of fullerenes, triangulations, and chordal graphs
It was recently pointed out that certain SiO_2 layer structures and SiO_...
research
∙
07/18/2018
Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes
Interconnection networks provide an effective mechanism for exchanging d...
research
∙
07/18/2018