DocumentCode
1432196
Title
Generation of trees, cotrees and 2-trees of a linear graph
Author
Cahit, R. ; Cahit, I.
Author_Institution
Turkish Industrial Market, Nicosia, Cyprus
Volume
119
Issue
9
fYear
1972
fDate
9/1/1972 12:00:00 AM
Firstpage
1275
Lastpage
1277
Abstract
A new algorithm for finding all trees, cotrees and 2-trees in a connected linear graph is given. The procedure will not generate any duplication, redundancies or cancellation of terms. The method given is based only on the definition of tree, so that no complexity arises. Further, it is shown that, if a certain condition is satisfied by the graph, the 2-trees can be obtained directly from the trees that have been generated. An illustrative example on the algorithm is also given.
Keywords
graph theory; trees (mathematics); 2-trees; cotrees; graph theory; linear graph; trees;
fLanguage
English
Journal_Title
Electrical Engineers, Proceedings of the Institution of
Publisher
iet
ISSN
0020-3270
Type
jour
DOI
10.1049/piee.1972.0247
Filename
5251440
Link To Document