On Combination and Permutation Graphs

被引:0
|
作者
Seoud, M. A. [1 ]
Anwar, M. [1 ]
机构
[1] Ain Shams Univ, Fac Sci, Dept Math, Cairo, Egypt
关键词
D O I
暂无
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We study: combination, permutation, strong k-combination and strong k-permutation graphs. We introduce some necessary conditions for a graph to be: a combination graph, a permutation graph, a strong k-combination graph and a strong k-permutation graph. We determine all maximal strong k-combination graphs of order <= 6.
引用
收藏
页码:243 / 255
页数:13
相关论文
共 50 条
  • [1] Some Families of Combination and Permutation Graphs
    Seoud, M. A.
    Anwar, M.
    [J]. ARS COMBINATORIA, 2016, 127 : 435 - 443
  • [2] PERMUTATION GRAPHS AND TRANSITIVE GRAPHS
    EVEN, S
    LEMPEL, A
    PNUELI, A
    [J]. JOURNAL OF THE ACM, 1972, 19 (03) : 400 - &
  • [3] Succinct Permutation Graphs
    Konstantinos Tsakalidis
    Sebastian Wild
    Viktor Zamaraev
    [J]. Algorithmica, 2023, 85 : 509 - 543
  • [4] SPLIT PERMUTATION GRAPHS
    BOUAZA, N
    [J]. COMPTES RENDUS DE L ACADEMIE DES SCIENCES SERIE I-MATHEMATIQUE, 1994, 318 (11): : 971 - 977
  • [5] On probe permutation graphs
    Chandler, David B.
    Chang, Maw-Shang
    Kloks, Ton
    Liu, Jiping
    Peng, Sheng-Lung
    [J]. DISCRETE APPLIED MATHEMATICS, 2009, 157 (12) : 2611 - 2619
  • [6] Split Permutation Graphs
    Korpelainen, Nicholas
    Lozin, Vadim V.
    Mayhill, Colin
    [J]. GRAPHS AND COMBINATORICS, 2014, 30 (03) : 633 - 646
  • [7] Split Permutation Graphs
    Nicholas Korpelainen
    Vadim V. Lozin
    Colin Mayhill
    [J]. Graphs and Combinatorics, 2014, 30 : 633 - 646
  • [8] Polar Permutation Graphs
    Ekim, Tinaz
    Heggernes, Pinar
    Meister, Daniel
    [J]. COMBINATORIAL ALGORITHMS, 2009, 5874 : 218 - +
  • [9] ON CYCLE PERMUTATION GRAPHS
    RINGEISEN, RD
    [J]. DISCRETE MATHEMATICS, 1984, 51 (03) : 265 - 275
  • [10] PLANAR PERMUTATION GRAPHS
    CHARTRAND, G
    HARARY, F
    [J]. ANNALES DE L INSTITUT HENRI POINCARE SECTION B-CALCUL DES PROBABILITES ET STATISTIQUE, 1967, 3 (04): : 433 - +