Skip to main content
SpringerLink
Log in

Upper bounds on vertex distinguishing chromatic index of some Halin graphs

  • Published:
Applied Mathematics-A Journal of Chinese Universities Aims and scope Submit manuscript

Abstract

A vertex distinguishing edge coloring of a graph G is a proper edge coloring of G such that any pair of vertices has the distinct sets of colors. The minimum number of colors required for a vertex distinguishing edge coloring of a graph G is denoted by χ′ s (G). In this paper, we obtained upper bounds on the vertex distinguishing chromatic index of 3-regular Halin graphs and Halin graphs with Δ(G) ≥ 4, respectively.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. P N Balister, O M Riordan, R H Schelp. Vertex-distinguishing edge colorings of graphs, J Graph Theory, 2003, 42(2): 95–109.

    Article  MathSciNet  MATH  Google Scholar 

  2. P N Balister, B Bollobás, R H Schelp. Vertex distinguishing colorings of graphs with Δ(G) = 2, (English summary), Discrete Math, 2002, 252(1–3): 17–29.

    Article  MathSciNet  MATH  Google Scholar 

  3. Y H Bu, K W Lih, W F Wang. Adjacent vertex distinguishing edge-colorings of Planar graphs with girth at least six, Discrete Math Graph Theory, 2011, 31: 429–439.

    Article  MathSciNet  MATH  Google Scholar 

  4. A C Burris, R H Schelp. Vertex-distinguishing proper edge-colorings, J Graph Theory, 1997, 26(2): 73–82.

    Article  MathSciNet  MATH  Google Scholar 

  5. X Chen, Z F Zhang. AVDTC numbers of generalized Halin graphs with maximum degree at least 6, Acta Math Appl Sin Engl Ser, 2008, 24(1): 55–58.

    Article  MathSciNet  MATH  Google Scholar 

  6. B Cristina, H B Amel, H Li. Woźniak, Mariusz. A note on the vertex-distinguishing proper coloring of graphs with large minimum degree, Discrete Math, 2001, 236(1–3): 37–42.

    MathSciNet  MATH  Google Scholar 

  7. B Cristina, H B Amel, H Li. Woźniak, Mariusz. On the vertex-distinguishing proper edge-colorings of graphs, J Combin Theory Ser B, 1999, 75(2): 288–301.

    Article  MathSciNet  MATH  Google Scholar 

  8. L Z Lin, Y Z Li, Z F Zhang, J F Wang. On the adjacent strong edge coloring of Halin graphs, J Math Res Exposition, 2003, 23(2): 241–246.

    MathSciNet  Google Scholar 

  9. K W Lin, D F Liu. On the strong chromatic index of cubic Halin graphs, Appl Math Lett, 2011, doi:10.1016 /j.aml.2011.10.046.

  10. L Z Liu, Z F Zhang. On the complete chromatic number of Halin graph, Acta Math Appl Sin Engl Ser, 1997, 13(1): 102–106.

    Article  MATH  Google Scholar 

  11. X Y Meng. On the Coloring of Pseudo-Halin Graph, Doctoral dissertation, Shandong University of Science and Technology, 2004: 6–7. (In Chinese)

  12. W C Shui, W H Chan, Z F Zhang, L Bian. On the adjacent vertex acyclic edge coloring of graphs, Appl Math J Chinese Univ Ser B, 2011, 26: 439–452.

    Article  MathSciNet  Google Scholar 

  13. W F Wang, K W Lih. List coloring Halin graphs, Ars Combin, 2005, 77: 53–63.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Xingzhi College, Zhejiang Normal University, Jinhua, 321004, China

    Jun-qiao Zhu

  2. College of Mathematics, Physics and Information Engineering, Zhejiang Normal University, Jinhua, 321004, China

    Yue-hua Bu

Authors
  1. Jun-qiao Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yue-hua Bu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yue-hua Bu.

Additional information

Supported by the National Natural Science Foundation of China (10971198) and the Zhejiang Natural Science Foundation of China (Z6110786).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhu, Jq., Bu, Yh. Upper bounds on vertex distinguishing chromatic index of some Halin graphs. Appl. Math. J. Chin. Univ. 27, 329–334 (2012). https://doi.org/10.1007/s11766-012-3009-2

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11766-012-3009-2

MR Subject Classification

Keywords

Search

Navigation