In this paper, we study two graph convexity parameters: iteration time a...
Let be any collection of paths of a graph G=(V,E). For S⊆ V,
define I(S...
A walk u_0u_1 … u_k-1u_k of a graph G is a weakly toll
walk if u_0u_k ∉E...
A walk u_0u_1 … u_k-1u_k is a weakly toll walk if u_0u_i
∈ E(G) implies ...
Graph convexity has been used as an important tool to better understand ...
The Kneser graph K(2n+k,n), for positive integers n and k, is the
graph ...
A knot in a directed graph G is a strongly connected subgraph Q of G
wit...