### Abstract

Some studies have been made on constructing highly reliable communications networks by the use of graph theory, where in many cases the restriction of regularity and the limitation on the numbers of nodes and branches are imposed. This study proposes approximate formula to calculate the number of independent routes by using the adjacency matrix of a graph. Then, using this formula, the adjacency matrix is optimized to obtain the desired number of independent routes or the desired reliability level. This design method can be used for an arbitrary number of nodes and an arbitrary number of branches.

Original language | English |
---|---|

Pages (from-to) | 120-125 |

Number of pages | 6 |

Journal | Electronics and Communications in Japan, Part I: Communications (English translation of Denshi Tsushin Gakkai Ronbunshi) |

Volume | 71 |

Issue number | 3 |

Publication status | Published - 1988 Mar |

Externally published | Yes |

### Fingerprint

### ASJC Scopus subject areas

- Computer Networks and Communications
- Electrical and Electronic Engineering

### Cite this

**DESIGN METHOD OF HIGHLY RELIABLE COMMUNICATION NETWORK BY THE USE OF MATRIX CALCULATION.** / Tanaka, Yoshiaki; Fan, Rui xue; Akiyama, Minoru.

Research output: Contribution to journal › Article

*Electronics and Communications in Japan, Part I: Communications (English translation of Denshi Tsushin Gakkai Ronbunshi)*, vol. 71, no. 3, pp. 120-125.

}

TY - JOUR

T1 - DESIGN METHOD OF HIGHLY RELIABLE COMMUNICATION NETWORK BY THE USE OF MATRIX CALCULATION.

AU - Tanaka, Yoshiaki

AU - Fan, Rui xue

AU - Akiyama, Minoru

PY - 1988/3

Y1 - 1988/3

N2 - Some studies have been made on constructing highly reliable communications networks by the use of graph theory, where in many cases the restriction of regularity and the limitation on the numbers of nodes and branches are imposed. This study proposes approximate formula to calculate the number of independent routes by using the adjacency matrix of a graph. Then, using this formula, the adjacency matrix is optimized to obtain the desired number of independent routes or the desired reliability level. This design method can be used for an arbitrary number of nodes and an arbitrary number of branches.

AB - Some studies have been made on constructing highly reliable communications networks by the use of graph theory, where in many cases the restriction of regularity and the limitation on the numbers of nodes and branches are imposed. This study proposes approximate formula to calculate the number of independent routes by using the adjacency matrix of a graph. Then, using this formula, the adjacency matrix is optimized to obtain the desired number of independent routes or the desired reliability level. This design method can be used for an arbitrary number of nodes and an arbitrary number of branches.

UR - http://www.scopus.com/inward/record.url?scp=0023983556&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0023983556&partnerID=8YFLogxK

M3 - Article

VL - 71

SP - 120

EP - 125

JO - Electronics and Communications in Japan, Part I: Communications (English translation of Denshi Tsushin Gakkai Ronbunshi)

JF - Electronics and Communications in Japan, Part I: Communications (English translation of Denshi Tsushin Gakkai Ronbunshi)

SN - 8756-6621

IS - 3

ER -