Isometric path numbers of graphs

檔案

日期

2006-09-06

類型

期刊名稱

DISCRETE MATHEMATICS

卷期與頁次

第 306 卷第 17 期,頁 2091–2096

ISSN

0012-365X

語言

英文

摘要

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.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Pan, J.-J., & Chang, G. J. (2006). Isometric path numbers of graphs. DISCRETE MATHEMATICS, 306(17), 2091–2096. https://doi.org/10.1016/j.disc.2006.04.003

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/11796