A proper total coloring distinguishing adjacent vertices by sums of some product graphs
2
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
In this article, we consider a proper total coloring distinguishes adjacent vertices by sums, if every two adjacent vertices have different total sum of colors of the edges incident to the vertex and the color of the vertex. Pilsniak and Wozniak~\cite{PW} first introduced this coloring and made a conjecture that the minimal number of colors need to have a proper total coloring distinguishes adjacent vertices by sums is less than or equal to the maximum degree plus $3$. We study proper total colorings distinguishing adjacent vertices by sums of some graphs and their products. We prove that these graphs satisfy the conjecture.
Abstract
In this article, we consider a proper total coloring distinguishes adjacent vertices by sums, if every two adjacent vertices have different total sum of colors of the edges incident to the vertex and the color of the vertex. Pilsniak and Wozniak~\cite{PW} first introduced this coloring and made a conjecture that the minimal number of colors need to have a proper total coloring distinguishes adjacent vertices by sums is less than or equal to the maximum degree plus $3$. We study proper total colorings distinguishing adjacent vertices by sums of some graphs and their products. We prove that these graphs satisfy the conjecture.
참고문헌 (21)
- J. Bondy, "Graph Theory with Applications" (1976), Elsevier
- X. Chen, "On the adjacent vertex distinguishing total coloring numbers of graphs with = 3", Discrete Math, 308(17), pp.4003~4007 (2008)
- M. Chen, "Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes", Inform. Process. Lett, 109(12), pp.599~602 (2009)
- X. Chen, "AVDTC numbers of generalized Halin graphs with maximum degree at least 6", Acta Math. Appl. Sin. Engl. Ser, 24(1), pp.55~58 (2008)
- X. Chen, "A note on adjacent-vertex-distinguishing total chromatic numbers for Pm ×Pn, Pm ×Cn and Cm ×Cn", J. Math. Res. Exposition, 28(4), pp.789~798 (2008)
- G. Dirac, "Map-colour theorems", Canad. J. Math, 4, pp.480~490 (1952)
- J. Gross, "Topological Graph Theory" (1987), Wiley
- D. Huang, "A note on the adjacent vertex distinguishing total chromatic number of graphs", Discrete Math, 312(24), pp.3544~3546 (2008)
- F. Hughes, "The achromatic number of graphs: a survey and some new results", Bull. Inst. Combin. Appl, 19, pp.27~56 (1997)
- J. Hulgan, "Concise proofs for adjacent vertex-distinguishing total colorings", Discrete Math, 309(8), pp.2548~2550 (2009)
- T. Jensen, "Graph Coloring Problems" (1995), Wiley-Interscience
- H. Li, "Neighbor sum distinguishing total colorings of K4-minor free graphs", Front. Math. China, 8(6), pp.1351~1366 (2013)
- C. P. de Mello, "Adjacent-vertex-distinguishing total coloring of indif-ference graphs", Mat. Contemp, 39, pp.101~110 (2010)
- M. Molloy, "A bound on the total chromatic number", Combinatorica, 18(2), pp.241~280 (1998)
- M. Pil´sniak, "On the adjacent-vertex-distinguishing index by sums in total proper colorings", Graphs Combin[DOI]
- C. Thomassen, "Chromatic graph theory, Challenges for the 21st century" (2001), World Sci. Publishing
- V. G. Vizing, "On an estimate of the chromatic class of a p-graph", Diskret. Analiz, 3, pp.25~30 (1964)
- W. Wang, "The adjacent vertex distinguishing total coloring of planar graphs", J. Comb. Optim, 27, pp.379~396 (2014)
- Y. Wang, "Adjacent vertex distinguishing total colorings of outerplanar graphs", J. Comb. Optim, 19(2), pp.123~133 (2010)
- Z. Zhang, "On adjacent-vertex-distinguishing total coloring of graphs", Sci. China Math, 48(3), pp.289~299 (2005)