IEICE TRANSACTIONS on Fundamentals
Properties of W-Tree
Summary :
We will introduce W-trees of a W-graph which is a graph containing wild components. A wild component is an incompletely defined subgraph which is known to be a tree but what kind of the tree is unspecified. W-tree is defined as a set of edges and vertices of wild components obtained from a non-sigular major submatrix of a W-incidence matrix. The properties of a W-tree are useful for studying linear independent W-cutsets and so on in a W-graph.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E75-A No.9 pp.1141-1147
- Publication Date
- 1992/09/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Graphs, Networks and Matroids
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Hua-An ZHAO, Wataru MAYEDA, "Properties of W-Tree" in IEICE TRANSACTIONS on Fundamentals,
vol. E75-A, no. 9, pp. 1141-1147, September 1992, doi: .
Abstract: We will introduce W-trees of a W-graph which is a graph containing wild components. A wild component is an incompletely defined subgraph which is known to be a tree but what kind of the tree is unspecified. W-tree is defined as a set of edges and vertices of wild components obtained from a non-sigular major submatrix of a W-incidence matrix. The properties of a W-tree are useful for studying linear independent W-cutsets and so on in a W-graph.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e75-a_9_1141/_p
Copy
@ARTICLE{e75-a_9_1141,
author={Hua-An ZHAO, Wataru MAYEDA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Properties of W-Tree},
year={1992},
volume={E75-A},
number={9},
pages={1141-1147},
abstract={We will introduce W-trees of a W-graph which is a graph containing wild components. A wild component is an incompletely defined subgraph which is known to be a tree but what kind of the tree is unspecified. W-tree is defined as a set of edges and vertices of wild components obtained from a non-sigular major submatrix of a W-incidence matrix. The properties of a W-tree are useful for studying linear independent W-cutsets and so on in a W-graph.},
keywords={},
doi={},
ISSN={},
month={September},}
Copy
TY - JOUR
TI - Properties of W-Tree
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1141
EP - 1147
AU - Hua-An ZHAO
AU - Wataru MAYEDA
PY - 1992
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E75-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 1992
AB - We will introduce W-trees of a W-graph which is a graph containing wild components. A wild component is an incompletely defined subgraph which is known to be a tree but what kind of the tree is unspecified. W-tree is defined as a set of edges and vertices of wild components obtained from a non-sigular major submatrix of a W-incidence matrix. The properties of a W-tree are useful for studying linear independent W-cutsets and so on in a W-graph.
ER -
English
