Incidence Coloring Number of Some Join Graphs

Gui Xiang Dong; Xiu Fang Liu

doi:10.4028/www.scientific.net/AMM.602-605.3185

Paper Titles

Multicast Routing Algorithm with QoS Constraints in Mobile Ad Hoc Networks
p.3169

Research on Stall Aerodynamics Modeling Based on WNN Trained by AFS-PSO Hybrid Algorithm from Flight Data
p.3173

Improved Wavelet Threshold Denoising Method
p.3177

Implementation of Image Matching Algorithm Based on SIFT Features
p.3181

Incidence Coloring Number of Some Join Graphs
p.3185

Task Scheduling in Cloud Computing with Improved Firefly Algorithm
p.3189

Application of AHP in Determining the Weights of Evaluation
p.3194

Research on the Construction of Crowdsourcing Platform
p.3198

Compatibility Check for Flight Test Data from Aircraft Based on Maximum Likelihood Method
p.3202

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 602-605Incidence Coloring Number of Some Join Graphs

Incidence Coloring Number of Some Join Graphs

Abstract:

The incidence coloring of a graph is a mapping from its incidence set to color set in which neighborly incidences are assigned different colors. In this paper, we determined the incidence coloring numbers of some join graphs with paths and paths, cycles, complete graphs, complete bipartite graphs, respectively, and the incidence coloring numbers of some join graphs with complete bipartite graphs and cycles, complete graphs, respectively.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 602-605)

Pages:

3185-3188

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.602-605.3185

Citation:

Cite this paper

Online since:

August 2014

Authors:

Gui Xiang Dong*, Xiu Fang Liu

Keywords:

Incidence Coloring, Incidence Coloring Number, Join Graph

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] J.A. Bondy and U.S.R. Murty. Graph Theory with Application[M], Mamilcan Press, New York, (1976).

Google Scholar

[2] Richard A. Brualdi and Jennifer J. Quinn Massey. Incidence and strong edge coloring of Graph[J], Discrete Mathematics, 1993, 122(1-3): 51-58.

DOI: 10.1016/0012-365x(93)90286-3

Google Scholar

[3] B. Guiduli. On incidence coloring and star arboricity of graphs[J], Discrete Mathematics, 1997, 163(1-3): 275-278. 5.

DOI: 10.1016/0012-365x(95)00342-t

Google Scholar

[4] I. Algor and N. Alon. The star arboricity of graphs[J], Discrete Mathematics, 1989, 75: 11-22.

DOI: 10.1016/0012-365x(89)90073-3

Google Scholar

[5] Dong-ling Chen, Xi-kui Liu, Shu-dong Wang. Incidence Coloring of Graph and Incidence Coloring Conjecture [J]. Mathematics in Economics, 1998, 15(3): 47-51.

Google Scholar

[6] Shu-Dong Wang, Dong-Ling Chen, Shan-Chen Pang. The incidence coloring number of Halin graphs and outerplanar graphs[J], Discrete Mathematics, 2002, 256(1-2): 397-405.

DOI: 10.1016/s0012-365x(01)00302-8

Google Scholar

[7] Wai Chee Shiu, Peter Che Bor Lam, Dong-Ling Chen, On incidence coloring for some cubic graphs[J], Discrete Mathematics, 2002, 252(1-3): 259-266.

DOI: 10.1016/s0012-365x(01)00457-5

Google Scholar

[8] Maksin Maydanskiy. The incidence coloring conjecture for graphs of maximum degree 3[J]. Discrete Mathematics, 2005, 292(1-3): 131-141.

DOI: 10.1016/j.disc.2005.02.003

Google Scholar

[9] Yan Li-jun, Wang Shu-dong, Ma Fang-fang. Incidence coloring of series-parallel graphs and Meredith graphs[J]. Applied Mathematics A Journal of Chinese Universities, 2008, 23(4): 481-486.

Google Scholar

[10] Li Deming, Liu Mingju. Incidence colorings of Cartesian products of graphs over path and cycles[J]. Advances In Mathematics, 2011, 40(6): 697-708.

Google Scholar