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.
机构:
TECH UNIV CAROLO WILHELMINA BRAUNSCHWEIG,DISKRETE MATH ABT,W-3300 BRAUNSCHWEIG,GERMANYTECH UNIV CAROLO WILHELMINA BRAUNSCHWEIG,DISKRETE MATH ABT,W-3300 BRAUNSCHWEIG,GERMANY
机构:
Clemson Univ, Sch Math & Stat Sci, Clemson, SC 29364 USA
Univ Johannesburg, Dept Math & Appl Math, Johannesburg, South AfricaClemson Univ, Sch Math & Stat Sci, Clemson, SC 29364 USA
Goddard, Wayne
Henning, Michael A.
论文数: 0引用数: 0
h-index: 0
机构:
Univ Johannesburg, Dept Math & Appl Math, Johannesburg, South AfricaClemson Univ, Sch Math & Stat Sci, Clemson, SC 29364 USA