Isometric path numbers of graphs

Title:	Isometric path numbers of graphs
Authors:	Pan, Jun-Jie Chang, Gerard J. 應用數學系 Department of Applied Mathematics
Keywords:	isometric path;complete r-partite graph;hamming graphs
Issue Date:	6-Sep-2006
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. (c) 2006 Elsevier B.V. All rights reserved.
URI:	http://dx.doi.org/10.1016/j.disc.2006.04.003 http://hdl.handle.net/11536/11796
ISSN:	0012-365X
DOI:	10.1016/j.disc.2006.04.003
Journal:	DISCRETE MATHEMATICS
Volume:	306
Issue:	17
Begin Page:	2091
End Page:	2096
Appears in Collections:	Articles

Files in This Item:

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.

APA	Pan, J., & Chang, G. J. (2006). Isometric path numbers of graphs. WOS:000240421800009.
Bibtex	@article{Pan2006Isometric, title={Isometric path numbers of graphs}, author={Pan, Jun-Jie and Chang, Gerard J.}, journal={WOS:000240421800009}, year={2006}, url={https://ir.lib.nycu.edu.tw/handle/11536/11796}, }