Title of article
Distance formula and shortest paths for the image-star graphs
Author/Authors
Eddie Cheng، نويسنده , , Jerrold W. Grossman، نويسنده , , Laszlo Liptak، نويسنده , , Ke-Qiu Chen، نويسنده , , Zhizhang Shen، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
10
From page
1671
To page
1680
Abstract
The class of image-star graphs is a generalization of the class of star graphs. Thus a distance formula for the first class implies one for the second. In this paper, we show that the converse is also true. Another important concept is the number of shortest paths between two vertices. This problem has been solved for the star graphs. We will solve the corresponding problem for the image-star graphs.
Keywords
Distance formula , k)(n , (N , k)-star graphs , shortest paths , Path enumeration
Journal title
Information Sciences
Serial Year
2010
Journal title
Information Sciences
Record number
1213932
Link To Document