Gracefulness of five permutation graphs of paths

Authors

  • Liang, Zhihe
  • Zhang, Huizhu
  • Xu, Na
  • Ye, Shuyan
  • Fan, Yanpeng
  • Ge, Hongmei

Abstract

For any integer n > 1, the permutation graphs P(Pn, f) are graceful when f=(12345), (2345), (234), (123456) and (23) (45).

Published

2007-05-09

How to Cite

Liang, Zhihe, Zhang, Huizhu, Xu, Na, Ye, Shuyan, Fan, Yanpeng, & Ge, Hongmei. (2007). Gracefulness of five permutation graphs of paths. Utilitas Mathematica, 72. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/500

Issue

Vol. 72 (2007): Volume 72, 2007

Section

Articles

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.