On the Packing Partitioning Problem on Directed Graphs
Open Access
- 6 December 2021
- journal article
- research article
- Published by MDPI AG in Mathematics
- Vol. 9 (23) , 3148
Abstract
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.Keywords
This publication has 7 references indexed in Scilit:
- Domination in digraphs and their direct and Cartesian productsJournal of Graph Theory, 2021
- Classes of Directed Graphs2018
- Handbook of Product Graphs2011
- The hierarchical product of graphsDiscrete Applied Mathematics, 2009
- Digraphs2009
- A new graph product and its spectrumBulletin of the Australian Mathematical Society, 1978
- Graphs and Combinatorics1974