Movatterモバイル変換


[0]ホーム

URL:


Skip to main content
Springer Nature Link
Log in

A Note on Decycling Number, Vertex Partition and AVD-Total Coloring in Graphs

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

This note provides a new perspective, i.e., graph embeddings on the decycling number\(\nabla (G)\) (Beineke and Vandell in J Graph Theory 25:59–77,1997) of a graphG. For this point, it is shown that\(\nabla (G)=\gamma _M(G)+\xi (G)\) for any cubic graphG and\(|S|=\frac{\beta (G)+m(S)}{k-1}\) for any decycling setS of ak-regular graphG, where\(\gamma _M(G)\),\(\xi (G)\),\(\beta (G)\) and\(m(S)=c(G-S)+|E(S)|-1\) (\(c(G-S)\) is the number of components of\(G-S\) and |E(S)| is the number of edges in a subgraphG[S]) are, respectively, the maximum genus, the Betti deficiency (Xuong in J Combin Theory Ser B 26:217–225,1979), the cycle rank (Harary in Graph theory, Academic Press, New York,1967) and the margin number ofG. Meanwhile, we further confirm that (1) a cubic graphG (\(G\ne K_4\)) has a vertex partition\((V_1, V_2)\) such that\(V_1\) is an independent set and\(V_2\) induces a forest and (2) ak-regular graphG with\(\nabla (G)=\frac{\beta (G)+m(S)}{k-1}\) (\(m(S)\le 2\)) has a vertex partition\((S,G-S)\) such thatG[S] contains at most two edges and\(G-S\) induces a forest, whereS is the smallest decycling set ofG. Resorting to the above vertex partitions, we get the adjacent vertex distinguishing (AVD) total chromatic numbers of some families of graphs, and these results verify Zhang’s conjecture (Zhang in Sci China Ser A 48:289–299,2005) that every graph with maximum degree\(\Delta \) has an AVD-total\((\Delta +3)\)-coloring.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Beineke, L., Vandell, R.: Decycling graphs. J. Graph Theory25, 59–77 (1997)

    Article MathSciNet  Google Scholar 

  2. Chen, X.: On the adjacent vertex distinguishing total coloring numbers of graphs with\(\Delta (G)=3\). Discrete Math.308, 4003–4007 (2009)

    Article MathSciNet  Google Scholar 

  3. Harary, F.: Graph theory. Academic Press, New York (1967)

    MATH  Google Scholar 

  4. Huang, D., Wang, W., Yan, C.: A note on the adjacent vertex distinguishing total chromatic number of graphs. Discrete Math.312, 3544–3546 (2012)

    Article MathSciNet  Google Scholar 

  5. Hulgan, J.: Concise proofs for adjacent vertex-distinguishing total colorings. Discrete Math.309, 2548–2550 (2009)

    Article MathSciNet  Google Scholar 

  6. Karp, R.: Reducibility among combinatorial problems, complexity of computer computations. In: Proc. Sympos., IBM Thomas J. Watson Res. Center, Yorktown Heights. Plenum, New York, pp 85-103 (1972)

  7. Pike, D., Zou, Y.: Decycling Cartesian products of two cycles. SIAM J. Discrete Math.19, 651–663 (2005)

    Article MathSciNet  Google Scholar 

  8. Wang, H.: On the adjacent vertex-distinguishing total chromatic numbers of the graphs with\(\Delta (G)=3\). J. Comb. Optim.14, 87–109 (2007)

    Article MathSciNet  Google Scholar 

  9. Xuong, N.: How to determine the maximum genus of a graph. J. Combin. Theory Ser. B26, 217–225 (1979)

    Article MathSciNet  Google Scholar 

  10. Zhang, Z., Chen, X., Li, J., Yao, B., Lv, X., Wang, J.: On adjacent-vertex-distinguishing total coloring of graphs. Sci. China Ser. A48, 289–299 (2005)

    Article MathSciNet  Google Scholar 

Download references

Acknowledgements

The authors would like to thank the anonymous referees for their valuable and constructive suggestions, which greatly improve the present paper. Supported by the National Natural Science Foundation of China under Grant Nos. 11171114, 11401576; Science and Technology Commission of Shanghai Municipality under Grant No. 13dz2260400

Author information

Authors and Affiliations

  1. School of Mathematics, Physics and Statistics, Shanghai University of Engineering Science, Shanghai, 201620, People’s Republic of China

    Chao Yang

  2. Department of Mathematics, East China Normal University, Shanghai, 200241, People’s Republic of China

    Han Ren

  3. Shanghai Key Laboratory of PMMP, Shanghai, 200241, People’s Republic of China

    Han Ren

  4. Department of Mathematics, Renmin University of China, Beijing, 100872, People’s Republic of China

    Erling Wei

Authors
  1. Chao Yang

    You can also search for this author inPubMed Google Scholar

  2. Han Ren

    You can also search for this author inPubMed Google Scholar

  3. Erling Wei

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence toChao Yang.

Rights and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yang, C., Ren, H. & Wei, E. A Note on Decycling Number, Vertex Partition and AVD-Total Coloring in Graphs.Graphs and Combinatorics34, 1325–1332 (2018). https://doi.org/10.1007/s00373-018-1959-8

Download citation

Keywords

Mathematics Subject Classification

Access this article

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Advertisement


[8]ページ先頭

©2009-2025 Movatter.jp