RT journal article
T1 (Open) packing number of some graph products
A1 Ali Mojdeh, Doost
A1 Peterin, Iztok
A1 Samadi, Babak
A1 González Yero, Ismael
A2 Matemáticas
K1 Packing number
K1 open packing number
K1 graph products
AB The packing number of a graph G is the maximum number of closed neighborhoods of vertices in G with pairwise empty intersections. Similarly, the open packing number of G is the maximum number of open neighborhoods in C with pairwise empty intersections. We consider the packing and open packing numbers on graph products. In particular we give a complete solution with respect to some properties of factors in the case of lexicographic and rooted products. For Cartesian, strong and direct products, we present several lower and upper bounds on these parameters.
PB DISCRETE MATHEMATICS THEORETICAL COMPUTER SCIENCE
SN 1462-7264
YR 2020
FD 2020
LK http://hdl.handle.net/10498/23836
UL http://hdl.handle.net/10498/23836
LA eng
DS Repositorio Institucional de la Universidad de Cádiz
RD 13-nov-2026