Graph Colorings Applied in Scale-Free Networks

Chao Yang; Bing  Yao; Hong Yu Wang; Xiang'en Chen; Si Hua Yang

doi:10.4028/www.scientific.net/AMR.760-762.2199

Paper Titles

A Novel Performance Metric of Routing Algorithm
p.2177

Analysis on Local Congestion of Network-on-Chip
p.2183

Numerical Simulation of the Protection System of Explosive Reaction Armor
p.2188

Self-Adaptive Particle Swarm Optimization Algorithm with Mutation Operation Based on K-Means
p.2194

Graph Colorings Applied in Scale-Free Networks
p.2199

Analysis of Project Shedule Risk Indexes in PERT Network Using Monte Carlo Simulation
p.2205

Fuzzy Reliability Design on Mechanical Components under Normal Distribution Based on Entropy Theory
p.2212

Circular Arc Gear Reliability Study Based on Modified FOSM Method
p.2216

The Application of Fuzzy Clustering Number Algorithm in Network Intrusion Detection
p.2220

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 760-762Graph Colorings Applied in Scale-Free Networks

Graph Colorings Applied in Scale-Free Networks

Abstract:

Building up graph models to simulate scale-free networks is an important method since graphs have been used in researching scale-free networks and communication networks, such as graph colorings can be used for distinguishing objects of communication and information networks. In this paper we determine the avdtc chromatic numbers of some models related with researching networks.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 760-762)

Pages:

2199-2204

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.760-762.2199

Citation:

Cite this paper

Online since:

September 2013

Authors:

Chao Yang, Bing Yao, Hong Yu Wang, Xiang'en Chen, Si Hua Yang

Keywords:

Links, Model, Nodes, Scale-Free Network, Vertex Distinguishing Total Colorings

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] P. N. Balister, B. Bollob´as, R. H. Schelp. Vetex Distinguishing Colorings of Graphs with Δ(G)=2, Discrete Mathematics, 252 (2002) 17-29.

DOI: 10.1016/s0012-365x(01)00287-4

Google Scholar

[2] Xiang'en Chen. On the Adjacent Vertex Distin-guishing Total Coloring Numbers of Graphs with Δ(G)=3. Discrete Mathematics 308 (2008) 4003-4007.

DOI: 10.1016/j.disc.2007.07.091

Google Scholar

[3] Haiying Wang. On the Adjacent Vertex-Distin-guishing Total Chromatic Numbers of the Graphs with Δ(G)=3. J. Comb. Optim., 14 (2007) 87-109.

DOI: 10.1007/s10878-006-9038-0

Google Scholar

[4] Jonathan Hulgan. Concise Proofs for Adjacent Vetex-Distinguishing Total Colorings. Discrete Mathematics, 309 (2009) 2548-2550.

DOI: 10.1016/j.disc.2008.06.002

Google Scholar

[5] Zhongfu Zhang, Xiang'en Chen, Jingwen Li, Bing Yao, et al. On the Adjacent Vertex-Distinguishing Total Coloring of Graphs. Science in China Series A, 48 (3) (2005) 289-299.

DOI: 10.1360/03ys0207

Google Scholar

[6] Zhongfu Zhang, Linzhong Liu, Jianfang Wang. Adjacent Strong Edge Coloring of Graphs. Applied Mathematics Letters, 15(5) (2002) 623-626.

DOI: 10.1016/s0893-9659(02)80015-5

Google Scholar

[7] Zhongfu Zhang, Pengxiang Qiu, Baogen Xu, Jingwen Li, Xiang'en Chen, Bing Yao. Vertex-Distinguishing Total Coloring of Graphs. Ars Combinatoria, 87 (2008) 33-35.

Google Scholar

[8] Li-wei Wang. On Adjacent Vertex Distinguishing Total Coloring of Generalized Petersen Graph. ShanDong Science, 20 (6) (2007) 4-8.

Google Scholar

[9] Bing Yao, Chao Yang, Xiang'en Chen. A Note on Graph Proper Total Colorings with Many Distinguishing Constraints. preprinted.

Google Scholar

[10] H. P. Yap. Total Colorings of Graphs. Springer, Berlin, Heidelberg, (1996).

Google Scholar

[11] .

Google Scholar

[11] J. A. Bondy, U. S. R. Murty. Graph Theory with Applications. The MaCmillan Press ltd, London and Basingstoke, New York, (1976).

Google Scholar