# Geodesic packing in graphs

Given a graph G, a geodesic packing in G is a set of vertex-disjoint maximal geodesics, and the geodesic packing number of G, (G), is the maximum cardinality of a geodesic packing in G. It is proved that the decision version of the geodesic packing number is NP-complete. We also consider the geodesic transversal number, (G), which is the minimum cardinality of a set of vertices that hit all maximal geodesics in G. While (G)≥(G) in every graph G, the quotient gt(G)/ gpack(G) is investigated. By using the rook's graph, it is proved that there does not exist a constant C < 3 such that gt(G)/ gpack(G)≤ C would hold for all graphs G. If T is a tree, then it is proved that gpack(T) = gt(T), and a linear algorithm for determining gpack(T) is derived. The geodesic packing number is also determined for the strong product of paths.

• 3 publications
• 2 publications
• 8 publications
research
04/09/2018

### A 5k-vertex Kernel for P_2-packing

The P_2-packing problem asks for whether a graph contains k vertex-disjo...
research
05/16/2018

### Labeled Packing of Cycles and Circuits

In 2013, Duchêne, Kheddouci, Nowakowski and Tahraoui [4, 9] introduced a...
research
08/29/2023

### Finding Optimal 2-Packing Sets on Arbitrary Graphs at Scale

A 2-packing set for an undirected graph G=(V,E) is a subset 𝒮⊂ V such th...
research
11/01/2019

### Computing Circle Packing Representations of Planar Graphs

The Circle Packing Theorem states that every planar graph can be represe...
research
03/02/2023

### Hierarchical cycle-tree packing model for K-core attack problem

The K-core of a graph is the unique maximum subgraph within which each v...
research
08/08/2018

### Packing colouring of some classes of cubic graphs

The packing chromatic number χ ρ (G) of a graph G is the smallest intege...
research
04/10/2022

### EPTAS for the dual of splittable bin packing with cardinality constraint

The problem considered is the splittable bin packing with cardinality co...