TY - JOUR
T1 - On the information transmission delay of the lexicographic product of digraphs
AU - Li, Feng
N1 - Publisher Copyright:
© 2018, Springer Science+Business Media, LLC, part of Springer Nature.
PY - 2019/4/15
Y1 - 2019/4/15
N2 - The maximum distance and average distance of a digraph play significant roles in analyzing efficiency of interconnection networks; it provides an efficient parameter to measure the transmission delay in the network. In this paper, we use the lexicographic product method to construct a larger digraph from several specified small digraphs. The digraph constructed by this way can contain the factor digraphs as subgraphs and preserve many desirable properties of the factor digraphs. By using the extremal values way of algebra, we investigate the distance parameters of the lexicographic product of digraphs and establish a formula for the vertex distance of the lexicographic product of digraphs.
AB - The maximum distance and average distance of a digraph play significant roles in analyzing efficiency of interconnection networks; it provides an efficient parameter to measure the transmission delay in the network. In this paper, we use the lexicographic product method to construct a larger digraph from several specified small digraphs. The digraph constructed by this way can contain the factor digraphs as subgraphs and preserve many desirable properties of the factor digraphs. By using the extremal values way of algebra, we investigate the distance parameters of the lexicographic product of digraphs and establish a formula for the vertex distance of the lexicographic product of digraphs.
KW - Digraph
KW - Interconnection network
KW - Lexicographic product
KW - Network distance
KW - Time delay
UR - https://www.scopus.com/pages/publications/85057178644
U2 - 10.1007/s11107-018-0806-4
DO - 10.1007/s11107-018-0806-4
M3 - 文章
AN - SCOPUS:85057178644
SN - 1387-974X
VL - 37
SP - 187
EP - 194
JO - Photonic Network Communications
JF - Photonic Network Communications
IS - 2
ER -