Isometric path numbers of graphs

DOI10.1016/J.DISC.2006.04.003zbMATH Open1100.05052OpenAlexW2018035502MaRDI QIDQ2501546FDOQ2501546

Authors Jun-Jie Pan, Gerard Jennhwa Chang

Publication date 14 September 2006

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0310332

zbMATH Keywords

Hamming graphscomplete \(r\)-partite graph

Mathematics Subject Classification ID

Paths and cycles (05C38)

Abstract: An isometric path between two vertices in a graph $G$ is a shortest path joining them. The isometric path number of $G$, denoted by $ip(G)$, is the minimum number of isometric paths needed to cover all vertices of $G$. In this paper, we determine exact values of isometric path numbers of complete $r$-partite graphs and Cartesian products of 2 or 3 complete graphs.

Recommendations

• The isometric path number of a graph
• Isometric-path numbers of block graphs
• scientific article; zbMATH DE number 1439423
• The ultimate isometric path number of a graph
• Publication:4489249

Cites work

• scientific article; zbMATH DE number 1439423 (Why is no real title available?)
• A game of cops and robbers
• Covering hypercubes by isometric paths
• Isometric-path numbers of block graphs
• The isometric path number of a graph
• Vertex-to-vertex pursuit in a graph

Cited in

(15)

• A general position problem in graph theory
• Strong geodetic number of complete bipartite graphs and of graphs with specified diameter
• On the isometric path partition problem
• Isometric-path numbers of block graphs
• The ultimate isometric path number of a graph
• Ramsey-type problems on induced covers and induced partitions toward the Gyárfás-Sumner conjecture
• Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes
• scientific article; zbMATH DE number 1472194 (Why is no real title available?)
• Strong geodetic number of graphs and connectivity
• Strong geodetic problem in grid-like architectures
• Strong edge geodetic problem in networks
• Fractional isometric path number
• Strong geodetic problem on Cartesian products of graphs
• The isometric path number of a graph
• Covering hypercubes by isometric paths

This page was built for publication: Isometric path numbers of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2501546)