Premium
On diameter of permutation graphs
Author(s) -
Gu Weizhen
Publication year - 1999
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/(sici)1097-0037(199905)33:3<161::aid-net1>3.0.co;2-3
Subject(s) - combinatorics , disjoint sets , permutation graph , permutation (music) , mathematics , graph , discrete mathematics , physics , acoustics
Let G be a connected graph with n vertices. Let α be a permutation in S n . The α‐generalized graph over G , denoted by P α ( G ), consists of two disjoint, identical copies of G along with edges να(ν). In this paper, we investigated the relation between diameter of P α ( G ) and diameter of G for any permutation α ∈ S n . © 1999 John Wiley & Sons, Inc. Networks 33: 161–166, 1999