The generalized Petersen graph P(n, 7) is (3n+6/2,3)-antimagic

Authors

  • Bao, Jingjing
  • Zhao, Lingqi
  • Yang, Yuansheng
  • Feng, Wei
  • Jirimutu

Abstract

A connected graph G = (V, E) is said to be (a, d)-antimagic if there exist positive integers a, d and a bijection f: E → (1,2,..., |E|} such that the induced mapping gf:V → N, defined by gf(v) = Σ(uv), uv ∈ E(G), is bijective mapping and gf(V) = {a, a + d,..., a + (|V| - 1)d}. Mirka Miller and Martin Bača conjectured that the generalized Petersen graph P(n, k) is (3n+6/2, 3)-antimagic for even n and 2 ≤ k ≤ n/2-1. Xirong Xu et al., Wei Feng et al. proved that the generalized Petersen graph P(n, k) is (3n+6/2, 3)-antimagic for k = 3, k = 5 and even n, respectively. In this paper, we show that P(n, 7) is (3n+6/2, 3)-antimagic for even n ≥ 16.

Published

2016-06-09

How to Cite

Bao, Jingjing, Zhao, Lingqi, Yang, Yuansheng, Feng, Wei, & Jirimutu. (2016). The generalized Petersen graph P(n, 7) is (3n+6/2,3)-antimagic. Utilitas Mathematica, 100. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/1147

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.