Open problem 1. For the paths Pₙ and the cycles Cₙ, determine if there is a vertex-antimagic total labeling for every feasible pair (a,d). Open problem 2. Apart from duality, how can a vertex-antimagic total labeling for a graph be used to construct another vertex-antimagic total labeling for the same graph, preferably with different a and d? Open problem 3. In Theorem 3, we found a way to construct VATL for a graph G from a vertex-magic total labeling of G. Are there other ways to do this? Open problem 4. Find, if possible, some structural characteristics of a graph which make a vertex-antimagic total labeling impossible
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.