Affiliation:
1. Beijing Institute of Graphic Communication
Abstract
Connectivity of the publishing Network is a basis problem to optimizing Network. In this paper, using of graph theory, through analyze graphs connected degree, obtain some good properties of Connectivity for the publishing Network.
Publisher
Trans Tech Publications, Ltd.
Reference6 articles.
1. Gray M R, Johnson D S. Computers and Intractability a Guide to the Theory of NP-Completeness[M]. London: W H Freeman And Company press Itd, (1979).
2. Hormkoric J, Jeschke C D, Monien B. Optimal algorithms for dissemination networks[A]. Proc. MFCS'90, Lecture Notes in Computer Science[C], Berlin: Springer, 1990, 337-346.
3. Stohr E. Broadcasting in the butterfly network[J]. Infor. Proc. Letters, 1991, 39: 41-43.
4. Liestman A L, Peters J G. Broadcast networks of bounded degree[J]. SIAM J. Disc. Math. 1988, 1: 531-540.
5. Bondy J A, Murty U S R. Graph Theory with Applications[M]. London: The Macmllian press Itd, (1976).