Properties of Circuits in a W-Graph

スポンサーリンク

概要

• 論文の詳細を見る

• A W-graph is a partially known graph which contains wild-components. A wild-component is an incompletely defined connected subgraph having p vertices and p-1 unspecified edges. The informations we know on a wild-component are which has a vertex set and between any two vertices there is one and only one path. In this paper, we discuss the properties of circuits in a W-graph (called W-circuits). Although a W-graph has unspecified edges, we can obtain some important properties of W-circuits. We show that the W-ring sum of W-circuits is also a W-circuit in the same W-graph. The following (1) and (2) are

• 社団法人電子情報通信学会の論文
• 1994-10-25

著者

• Zhao Hua-an

  Faculty Of Engineering Kyushu Kyoritsu University

• Mayeda Wataru

  School of Business, Hiroshima Prefectural University

• Mayeda Wataru

  School Of Business Hiroshima Prefectural University

関連論文

• Properties of Circuits in a W-Graph

スポンサーリンク