Isometric path partition number of honeycomb derived networks
R. Prabha, Ravi Kalaiyarasi · AIP conference proceedings · 2020
An isometric path partition of a graph G is a set of isometric paths that partition the vertex set of the graph G. The isometric path partition number of a graph is the cardinality of a minimum set of isometric paths that partitions the vertex set of the graph. In this paper, we investigate the isometric path partition number of honeycomb, silicate, oxide and hexagonal networks.