For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Properties of W-Tree
Hua-An ZHAO Wataru MAYEDA
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1992/09/25
Print ISSN: 0916-8508
Type of Manuscript: PAPER
Category: Graphs, Networks and Matroids
graph, tree, W-graph, W-tree,
Full Text: PDF(494.8KB)>>
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.