DocumentCode :
1175226
Title :
Hybrid trees and hybrid tree graphs
Author :
Sengoku, Masakazu
Volume :
22
Issue :
10
fYear :
1975
fDate :
10/1/1975 12:00:00 AM
Firstpage :
786
Lastpage :
790
Abstract :
A subgraph "a hybrid tree" in a linear graph 
which has properties of both a tree and a cotree is defined. In the definition, the set 
of edges of is partitioned into two subsets. The relations between the number of edges of a hybrid tree and the partition of are discussed. Furthermore, a hybrid tree graph which is a generalized concept of a tree graph and a cotree graph is defined and its some properties are presented.
which has properties of both a tree and a cotree is defined. In the definition, the set of edges of is partitioned into two subsets. The relations between the number of edges of a hybrid tree and the partition of are discussed. Furthermore, a hybrid tree graph which is a generalized concept of a tree graph and a cotree graph is defined and its some properties are presented.Keywords :
Graph theory and network topology; Trees; Circuits; Graph theory; Network theory (graphs); Tree graphs;
fLanguage :
English
Journal_Title :
Circuits and Systems, IEEE Transactions on
Publisher :
ieee
ISSN :
0098-4094
Type :
jour
DOI :
10.1109/TCS.1975.1083980
Filename :
1083980
Link To Document :
