Isometric-path numbers of block graphs

DOI10.1016/J.IPL.2004.09.021zbMATH Open1173.68612arXivmath/0407168OpenAlexW2016617155MaRDI QIDQ835002FDOQ835002

Gerard Jennhwa Chang, Jun-Jie Pan

Publication date: 27 August 2009

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

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.

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

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

zbMATH Keywords

algorithmsblock graphcut-vertexisometric path

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Vertex-to-vertex pursuit in a graph
• A game of cops and robbers
• The isometric path number of a graph
• Title not available (Why is that?)
• Covering hypercubes by isometric paths

Cited In (10)

• A GENERAL POSITION PROBLEM IN GRAPH THEORY
• On graphs coverable by \({k}\) shortest paths
• 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
• On the isometric path partition problem
• Isometric path numbers of graphs
• Parameterizing path partitions
• The isometric path number of a graph
• Fractional isometric path number

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)