DocumentCode
771421
Title
Interpolation theorem for the number of generalized end-vertices of spanning trees
Author
Cho, Hwan-Gue ; Chwa, Kyung-yong
Author_Institution
Dept. of Comput. Sci., Pusan Nat. Univ., South Korea
Volume
38
Issue
1
fYear
1991
fDate
1/1/1991 12:00:00 AM
Firstpage
128
Lastpage
130
Abstract
The concept of end-vertex is generalized by defining the k -end-vertex, where the end-vertex of G is the 1-end-vertex of G . It is then proved that the number of k -end-vertices of spanning trees of a graph G has the interpolation property for every positive integer k . This is a generalization of S. Schuster´s (1983) interpolation theorem
Keywords
interpolation; trees (mathematics); end-vertex; generalized end-vertices; graph; interpolation theorem; spanning trees; Biology computing; Clustering algorithms; Image analysis; Image processing; Interpolation; Partitioning algorithms; Pattern analysis; Pattern recognition; Tree graphs; Very large scale integration;
fLanguage
English
Journal_Title
Circuits and Systems, IEEE Transactions on
Publisher
ieee
ISSN
0098-4094
Type
jour
DOI
10.1109/31.101310
Filename
101310
Link To Document