On the Packing Partitioning Problem on Directed Graphs

Ficheros
Estadísticas
Métricas y Citas
Metadatos
Mostrar el registro completo del ítemFecha
2021-12Departamento/s
MatemáticasFuente
Mathematics 2021, 9(23), 3148Resumen
This work is aimed to continue studying the packing sets of digraphs via the perspective of
partitioning the vertex set of a digraph into packing sets (which can be interpreted as a type of vertex
coloring of digraphs) and focused on finding the minimum cardinality among all packing partitions
for a given digraph D, called the packing partition number of D. Some lower and upper bounds on
this parameter are proven, and their exact values for directed trees are given in this paper. In the case
of directed trees, the proof results in a polynomial-time algorithm for finding a packing partition of
minimum cardinality. We also consider this parameter in digraph products. In particular, a complete
solution to this case is presented when dealing with the rooted products.
Materias
packing number; packing partition number; Cartesian product; direct product; lexicographic product; strong product; rooted product; directed treeColecciones
- Artículos Científicos [12059]
- Articulos Científicos Matemáticas [519]
Ítems relacionados
Mostrando ítems relacionados por Título, autor o materia.






