Permutation labeling of graphs

A. Q. Baig, M. Imran

Research output: Contribution to journalArticlepeer-review

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 languageEnglish
Pages (from-to)135-143
Number of pages9
JournalJournal of Combinatorial Mathematics and Combinatorial Computing
Volume81
Publication statusPublished - May 2012
Externally publishedYes

Keywords

  • Distinct
  • Edge values
  • Permutation
  • Wheel related graph

ASJC Scopus subject areas

  • General Mathematics

Fingerprint

Dive into the research topics of 'Permutation labeling of graphs'. Together they form a unique fingerprint.

Cite this