Adjacent Vertex-Distinguishing E-Total Coloring on the Multiple Join Graph of Complete Graph and Wheel

Mu Chun Li; Li Zhang

doi:10.4028/www.scientific.net/AMM.303-306.1605

Paper Titles

Research on Ontology Construction Automatically in the Law Field
p.1585

Cotton and Bast Fiber Image Segmentation Based on Mathematical Morphology
p.1590

Portfolio Optimization for Index Investing Based on Self-Organizing Neural Network
p.1595

No-Reference Blur Assessment Based on Entropy and PCNN for Restoration Images
p.1599

Adjacent Vertex-Distinguishing E-Total Coloring on the Multiple Join Graph of Complete Graph and Wheel
p.1605

Classification Algorithm for Naïve Bayes Based on Validity and Correlation
p.1609

Weighted BMO Estimates for Commutators of Riesz Transforms Associated with Schrödinger Operator
p.1613

Research on Methods to Improve Parallel Coordinates Visualization
p.1618

A Fast Acquisition System for Large-Scale Optical Microscopic Integrated Circuit Chip Images Based on Thin Plate Spline
p.1629

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 303-306Adjacent Vertex-Distinguishing E-Total Coloring on...

Adjacent Vertex-Distinguishing E-Total Coloring on the Multiple Join Graph of Complete Graph and Wheel

Abstract:

υυυLet G be a simple graph, k be a positive integer, f be a mapping from V(G)∪E(G) to {1,2,...,k} . If ∀uv∈E(G) , we have f(u)≠f(v) , f(u)≠f(uv),f(v)≠f(uv) , C(u)≠C(v), where C(u)={f(u)}∪{f(uv)|uv∈E(G)}. Then f is called the adjacent vertex distinguishing E-total coloring of G. The number is called the adjacent vertex –distinguishing E-total chromatic number of χSubscript text(G)=min{k|G has a k-AVDETC} . The adjacent vertex distinguishing E-total chromatic numbers of the multiple join graph of wheel and complete graph are obtained in this paper.

You might also be interested in these eBooks

Sensors, Measurement and Intelligent Materials

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 303-306)

Pages:

1605-1608

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.303-306.1605

Citation:

Cite this paper

Online since:

February 2013

Authors:

Mu Chun Li, Li Zhang

Keywords:

Adjacent Vertex-Distinguishing E-Total Coloring, Complete Graph, Multiple Join Graph

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] A.C. Burris and R.H. Schelp. Vertex-distinguishing proper edge-colorings[J]. J. of Graph Theory, 1997, 26(2): 73-82.

DOI: 10.1002/(sici)1097-0118(199710)26:2<73::aid-jgt2>3.0.co;2-c

Google Scholar

[2] Zhong-fu Zhang, Lin-zhong Liu, Jian-fang Wang. Adjacent strong edge coloring of graphs[J]. Applied Mathematics Letters 2002, 15(5): 623-626.

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

Google Scholar

[3] Zhongfu Zhang, Xiang'en Chen, Jingwen Li, et al. On adjacent-vertex-distinguishing total coloring of graphs[J]. Science in China Ser. A, 2005, 48(3): 289-299.

DOI: 10.1360/03ys0207

Google Scholar

[4] Zhongfu Zhang, Pengxiang Qiu, Baogen Xu, etal. Vertex-distinguishing total coloring of graphs[J]. Ars Combinatoria, 2008, 87: 33-45.

Google Scholar

[5] Bondy J. A. Murty U . S . R. Graph Theory with Applications[M]. London : The Macmillan Press Ltd (1976).

Google Scholar

[6] Jingwen Li. Several distinguishing coloring of graphs[R]. The conference of Chinas electronic circuits and systems branch to graph theory and system optimize professional committee in (2011).

Google Scholar