Incidence Coloring Number of Some Join Graphs

Article Preview

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

Info:

Periodical:

Pages:

3185-3188

Citation:

Online since:

August 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[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