Study on Connectivity of the Publishing Network

Xiao Feng Zhu; Er Yan Zhang; Li Jun Yang; Dan Wang

doi:10.4028/www.scientific.net/AMR.846-847.535

Paper Titles

The Temperature-Online-Measuring and Energy-Saving System for Drying Cylinder Based on Network Communication
p.517

Design and Analysis of Ultra-Wideband Antenna with Triple Band-Notched Characteristic
p.521

Time Synchronization for Large Scale Wireless Sensor Networks Based on Multi-Broadcast Gossip Algorithm
p.526

Based on LPC2388 Mine Microseismic Monitor
p.531

Study on Connectivity of the Publishing Network
p.535

Experimental Study on the Magnetic Properties of MSMA and the Function of MSMA Actuator of Reticulated Shell Structure
p.539

A Study of Novel Cuk Grid-Connected Inverter Based on Double-Loop Control
p.543

An ICA and AIS Based Method for Electromagnetic Compatibility Analysis
p.547

Sensitive Ports under the Action of Different ESD Models of High-Frequency Low-Noise Silicon Bipolar Transistors
p.551

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 846-847Study on Connectivity of the Publishing Network

Study on Connectivity of the Publishing Network

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.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 846-847)

Pages:

535-538

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.846-847.535

Citation:

Cite this paper

Online since:

November 2013

Authors:

Xiao Feng Zhu*, Er Yan Zhang, Li Jun Yang, Dan Wang

Keywords:

Augmented Graph, Connectivity, Matching, Publishing Network

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[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).

Google Scholar

[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.

DOI: 10.1007/bfb0029627

Google Scholar

[3] Stohr E. Broadcasting in the butterfly network[J]. Infor. Proc. Letters, 1991, 39: 41-43.

Google Scholar

[4] Liestman A L, Peters J G. Broadcast networks of bounded degree[J]. SIAM J. Disc. Math. 1988, 1: 531-540.

DOI: 10.1137/0401049

Google Scholar

[5] Bondy J A, Murty U S R. Graph Theory with Applications[M]. London: The Macmllian press Itd, (1976).

Google Scholar

[6] Zhu Xiaofeng, Yang Lijun and Zhou Feiyan. A Scheme on Fault-Tolerant Broadcasting for Directed Communication Network with Time Bounds[A]. Proc. Computer-Aided Design, Manufacturing, Modeling and Simulation II, Applied Mechanics and Materials, 2013, v246-247: 398-402.

DOI: 10.4028/www.scientific.net/amm.246-247.398

Google Scholar