Isometric path numbers of graphs

標題:	Isometric path numbers of graphs
作者:	Pan, Jun-Jie Chang, Gerard J. 應用數學系 Department of Applied Mathematics
關鍵字:	isometric path;complete r-partite graph;hamming graphs
公開日期:	6-Sep-2006
摘要:	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
期刊:	DISCRETE MATHEMATICS
Volume:	306
Issue:	17
起始頁:	2091
結束頁:	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.