Abstract
A (p, q)-graph is said to be permutation graph if there exists a bijection function f : V(G) → {1, 2, ,p} such that the induced edge function hf : E(G) → N is defined as follows In this paper, we investigate the permutation labelings of wheel related graphs.
| Original language | English |
|---|---|
| Pages (from-to) | 135-143 |
| Number of pages | 9 |
| Journal | Journal of Combinatorial Mathematics and Combinatorial Computing |
| Volume | 81 |
| Publication status | Published - May 2012 |
| Externally published | Yes |
Keywords
- Distinct
- Edge values
- Permutation
- Wheel related graph
ASJC Scopus subject areas
- Mathematics(all)