Isometric-path numbers of block graphs

DOI10.1016/J.IPL.2004.09.021MaRDI QIDQ835002zbMATH OpenOpenAlexFDO

Authors Jun-Jie Pan, Gerard Jennhwa Chang

Publication date 27 August 2009

Published in Information Processing Letters (Search for Journal in Brave)

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

zbMATH Keywords

algorithmsblock graphcut-vertexisometric path

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

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 required to cover all vertices of G. In this paper, we determine exact values of isometric-path numbers of block graphs. We also give a linear-time algorithm for finding the corresponding paths.

Recommendations

• Isometric path numbers of graphs
• The isometric path number of a graph
• The ultimate isometric path number of a graph
• scientific article; zbMATH DE number 1439423
• Fractional isometric path number

Cites work

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

Cited in

(10)

• A general position problem in graph theory
• On the isometric path partition problem
• Ramsey-type problems on induced covers and induced partitions toward the Gyárfás-Sumner conjecture
• Path partition for graphs with special blocks
• On the general position number of the k -th power graphs
• Isometric path numbers of graphs
• Parameterizing path partitions
• Fractional isometric path number
• On graphs coverable by \({k}\) shortest paths
• The isometric path number of a graph

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

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