DocumentCode
1187395
Title
On the number of essential complementary partitions
Author
Kajitani, Y. ; Ueno, Satoshi
Volume
29
Issue
8
fYear
1982
fDate
8/1/1982 12:00:00 AM
Firstpage
572
Lastpage
574
Abstract
The essential complementary partition of a finite set 
was defined by Chen [1] for the purpose of listing all trees of a graph. For of cardinality 
, Chen and Goyal [2] conjectured that the number of distinct essential complementary partitions is 
. This correspondence proves that this conjecture is true.
was defined by Chen [1] for the purpose of listing all trees of a graph. For of cardinality , Chen and Goyal [2] conjectured that the number of distinct essential complementary partitions is . This correspondence proves that this conjecture is true.Keywords
Trees; Circuits and systems; Partitioning algorithms; Tree graphs;
fLanguage
English
Journal_Title
Circuits and Systems, IEEE Transactions on
Publisher
ieee
ISSN
0098-4094
Type
jour
DOI
10.1109/TCS.1982.1085187
Filename
1085187
Link To Document