A strong geodetic set of a graph G=(V,E) is a vertex set S ⊆ V(G)
in whi...
An orientation D of a graph G=(V,E) is a digraph obtained from G by
repl...
A biclique of a graph G is an induced complete bipartite subgraph of G
s...
A graph on n vertices is equitably k-colorable if it is k-colorable and
...
We study the problem of determining whether a given graph G=(V, E) admit...