Isometric-path numbers of block graphs
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
102 | en_US |
dc.citation.issue |
2 | en_US |
dc.citation.spage |
99 | en_US |
dc.citation.volume |
93 | en_US |
dc.citation.woscount |
2 | |
dc.contributor.author |
Pan, JJ | en_US |
dc.contributor.author |
Chang, GJ | en_US |
dc.contributor.department |
應用數學系 | zh_TW |
dc.contributor.department |
Department of Applied Mathematics | en_US |
dc.date.accessioned |
2014-12-08T15:35:39Z | |
dc.date.available |
2014-12-08T15:35:39Z | |
dc.date.issued |
2005-01-31 | en_US |
dc.description.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. (C) 2004 Elsevier B.V. All rights reserved. | en_US |
dc.identifier.doi |
10.1016/j.ipl.2004.09.021 | en_US |
dc.identifier.issn |
0020-0190 | en_US |
dc.identifier.journal |
INFORMATION PROCESSING LETTERS | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1016/j.ipl.2004.09.021 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/24063 | |
dc.identifier.wosnumber |
WOS:000225896700008 | |
dc.language.iso |
en_US | en_US |
dc.subject |
isometric path | en_US |
dc.subject |
block graph | en_US |
dc.subject |
cut-vertex | en_US |
dc.subject |
algorithms | en_US |
dc.title |
Isometric-path numbers of block graphs | en_US |
dc.type |
Article | en_US |
檔案
- 000225896700008.pdf (86.9 KB, Adobe PDF)
所屬典藏: 期刊論文