DocumentCode :
754762
Title :
Bounds on the Number of Possible Distinct Networks
Author :
Nesenbergs, Martin
Author_Institution :
Inst. for Telecommunication Sciences, Boulder, CO
Volume :
26
Issue :
8
fYear :
1978
fDate :
8/1/1978 12:00:00 AM
Firstpage :
1315
Lastpage :
1316
Abstract :
This note is concerned with the number of all distinct networks, also called connected graphs, or Cayley, or linear graphs that are possible for 
given nodes. Since for any practical number of nodes an explicit enumeration appears difficult, if not impossible, we offer an improved lower bound that enables tight approximation for reasonably large.
given nodes. Since for any practical number of nodes an explicit enumeration appears difficult, if not impossible, we offer an improved lower bound that enables tight approximation for reasonably large.Keywords :
Graph theory; Communications Society; Telecommunication computing; Telecommunication network topology; Tree graphs; US Department of Commerce; Upper bound;
fLanguage :
English
Journal_Title :
Communications, IEEE Transactions on
Publisher :
ieee
ISSN :
0090-6778
Type :
jour
DOI :
10.1109/TCOM.1978.1094222
Filename :
1094222
Link To Document :
