PACKING PARAMETERS IN GRAPHS

被引：14
|
作者：
Hamid, I. Sahul [1 ]
Saravanakumar, S. [1 ]
机构：
[1] Madura Coll, Dept Math, Madurai, Tamil Nadu, India
来源：
DISCUSSIONES MATHEMATICAE GRAPH THEORY | 2015年 / 35卷 / 01期
关键词：
packing number; open packing number; COVERING NUMBERS;
D O I：
10.7151/dmgt.1775
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In a graph G = (V, E), a non-empty set S subset of V is said to be an open packing set if no two vertices of S have a common neighbour in G. An open packing set which is not a proper subset of any open packing set is called a maximal open packing set. The minimum and maximum cardinalities of a maximal open packing set are respectively called the lower open packing number and the open packing number and are denoted by rho(0)(L) and rho(0). In this paper, we present some bounds on these parameters.
引用
收藏
页码：5 / 6
页数：2
相关论文
共 50 条
  • [41] On general packing functions in graphs
    Hinrichsen, Erica
    Nasini, Graciela
    Vansteenkiste, Natali
    XII LATIN-AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM, LAGOS 2023, 2023, 224 : 367 - 369
  • [42] Packing cuts in undirected graphs
    Caprara, A
    Panconesi, A
    Rizzi, R
    NETWORKS, 2004, 44 (01) : 1 - 11
  • [43] Packing paths in complete graphs
    Bryant, Darryn
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2010, 100 (02) : 206 - 215
  • [44] Packing Random Graphs and Hypergraphs
    Bollobas, Bela
    Janson, Svante
    Scott, Alex
    RANDOM STRUCTURES & ALGORITHMS, 2017, 51 (01) : 3 - 13
  • [45] On asymptotic packing of geometric graphs
    Cranston, Daniel W.
    Nie, Jiaxi
    Verstraete, Jacques
    Wesolek, Alexandra
    DISCRETE APPLIED MATHEMATICS, 2022, 322 : 142 - 152
  • [46] On packing shortest cycles in graphs
    Rautenbach, Dieter
    Regen, Friedrich
    INFORMATION PROCESSING LETTERS, 2009, 109 (14) : 816 - 821
  • [47] Grundy packing coloring of graphs☆
    Gozupek, Didem
    Peterin, Iztok
    DISCRETE APPLIED MATHEMATICS, 2025, 371 : 17 - 30
  • [48] PACKING TREES IN COMPLETE GRAPHS
    HOBBS, AM
    BOURGEOIS, BA
    KASIRAJ, J
    DISCRETE MATHEMATICS, 1987, 67 (01) : 27 - 42
  • [49] Packing and covering triangles in graphs
    Haxell, PE
    DISCRETE MATHEMATICS, 1999, 195 (1-3) : 251 - 254
  • [50] Packing trees into planar graphs
    García, A
    Hernando, C
    Hurtado, F
    Noy, M
    Tejel, J
    JOURNAL OF GRAPH THEORY, 2002, 40 (03) : 172 - 181
12345