This paper presents an optimum design method of reliable networks. This paper, first, discusses several design methods for undirected graphs. It is shown that one new method of them gives graphs with the minimum diameter in a certain domain. In order to obtain optimum graph when the number of nodes and degree are given, this paper next discusses a method to obtain modified graphs with larger connectivity and also with the minimum diameter from known graphs which have diameter 1 over the minimum.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Hiroshi MASUYAMA, Tetsuo ICHIMORI, Okihiko ISHIZUKA, "The Optimum Design Method of Reliable Networks" in IEICE TRANSACTIONS on transactions,
vol. E71-E, no. 12, pp. 1273-1281, December 1988, doi: .
Abstract: This paper presents an optimum design method of reliable networks. This paper, first, discusses several design methods for undirected graphs. It is shown that one new method of them gives graphs with the minimum diameter in a certain domain. In order to obtain optimum graph when the number of nodes and degree are given, this paper next discusses a method to obtain modified graphs with larger connectivity and also with the minimum diameter from known graphs which have diameter 1 over the minimum.
URL: https://globals.ieice.org/en_transactions/transactions/10.1587/e71-e_12_1273/_p
Copy
@ARTICLE{e71-e_12_1273,
author={Hiroshi MASUYAMA, Tetsuo ICHIMORI, Okihiko ISHIZUKA, },
journal={IEICE TRANSACTIONS on transactions},
title={The Optimum Design Method of Reliable Networks},
year={1988},
volume={E71-E},
number={12},
pages={1273-1281},
abstract={This paper presents an optimum design method of reliable networks. This paper, first, discusses several design methods for undirected graphs. It is shown that one new method of them gives graphs with the minimum diameter in a certain domain. In order to obtain optimum graph when the number of nodes and degree are given, this paper next discusses a method to obtain modified graphs with larger connectivity and also with the minimum diameter from known graphs which have diameter 1 over the minimum.},
keywords={},
doi={},
ISSN={},
month={December},}
Copy
TY - JOUR
TI - The Optimum Design Method of Reliable Networks
T2 - IEICE TRANSACTIONS on transactions
SP - 1273
EP - 1281
AU - Hiroshi MASUYAMA
AU - Tetsuo ICHIMORI
AU - Okihiko ISHIZUKA
PY - 1988
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E71-E
IS - 12
JA - IEICE TRANSACTIONS on transactions
Y1 - December 1988
AB - This paper presents an optimum design method of reliable networks. This paper, first, discusses several design methods for undirected graphs. It is shown that one new method of them gives graphs with the minimum diameter in a certain domain. In order to obtain optimum graph when the number of nodes and degree are given, this paper next discusses a method to obtain modified graphs with larger connectivity and also with the minimum diameter from known graphs which have diameter 1 over the minimum.
ER -