Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Neighbor Sum Distinguishing Index of \(K_4\)-Minor Free Graphs

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

Abstract

A proper [k]-edge coloring of a graph G is a proper edge coloring of G using colors from \([k]=\{1,2,\ldots ,k\}\). A neighbor sum distinguishing [k]-edge coloring of G is a proper [k]-edge coloring of G such that for each edge \(uv\in E(G)\), the sum of colors taken on the edges incident to u is different from the sum of colors taken on the edges incident to v. By nsdi(G), we denote the smallest value k in such a coloring of G. It was conjectured by Flandrin et al. that if G is a connected graph with at least three vertices and \(G\ne C_5\), then nsdi\((G)\le \varDelta (G)+2\). In this paper, we prove that this conjecture holds for \(K_4\)-minor free graphs, moreover if \(\varDelta (G)\ge 5\), we show that nsdi\((G)\le \varDelta (G)+1\). The bound \(\varDelta (G)+1\) is sharp.

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
$34.99 /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 excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  1. Addario-Berry, L., Dalal, K., McDiarmid, C., Reed, B.A., Thomason, A.: Vertex-coloring edge-weightings. Combintorica 27, 1–12 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  2. Addario-Berry, L., Dalal, K., Reed, B.A.: Degree constrained subgraphs. Discrete Appl. Math. 156, 1168–1174 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  3. Akbari, S., Bidkhori, H., Nosrati, N.: \(r\)-Strong edge colorings of graphs. Discrete Math. 306, 3005–3010 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  4. Balister, P.N., Győri, E., Lehel, J., Schelp, R.H.: Adjacent vertex distinguishing edge-colorings. SIAM J. Discrete Math. 21, 237–250 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bonamy, M., Przybyło, J.: On the neighbor sum distinguishing index of planar graphs. arXiv:1408.3190

  6. Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer-Verlag, London (2008)

    Book  MATH  Google Scholar 

  7. Bu, Y., Lih, K., Wang, W.: Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six. Discussiones Mathematicae Graph Theory 31–3, 429–439 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  8. Chartrand, G., Harary, F.: Planar permutation graphs. Ann. Inst. H. Poincaré Sect. B (N.S.) 3, 433–438 (1967)

    MathSciNet  MATH  Google Scholar 

  9. Dong, A., Wang, G., Zhang, J.: Neighbor sum distinguishing colorings of graphs with bounded maximum average degree. Discrete Appl. Math. 30–4, 703–709 (2014)

    MathSciNet  MATH  Google Scholar 

  10. Edwards, K., Horn̆ák, M., Woźniak, M.: On the neighbour-distinguishing index of a graph. Graphs Comb. 22, 341–350 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  11. Flandrin, E., Marczyk, A., Przybyło, J., Saclé, J.-F., Woźniak, M.: Neighbor sum distinguishing index. Graphs Comb. 29–5, 1329–1336 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  12. Hatami, H.: \(\Delta \)+300 is a bound on the adjacent vertex distinguishing edge chromatic number. J. Comb. Theory Ser. B 95, 246–256 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  13. Horn̆ák, M., Huang, D., Wang, W.: On neighbour-distinguishing index of planar graphs. J. Graph Theory 76—-4, 262–278 (2014)

    Article  Google Scholar 

  14. Kalkowski, M., Karoński, M., Pfender, F.: Vertex-coloring edge-weightings: towards the 1-2-3-conjecture. J. Comb. Theory Ser. B 100, 347–349 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  15. Karoński, M., Łuczak, T., Thomason, A.: Edge weights and vertex colors. J. Comb. Theory Ser. B 91, 151–157 (2004)

    Article  MATH  Google Scholar 

  16. Li, H., Ding, L. Liu, B., Wang, G.: Neighbor sum distinguishing total colorings of planar graphs. J. Comb. Optim. doi:10.1007/s10878-013-9660-6

  17. Przybyło, J.: Neighbor sum distinguishing colorings via the Combinatorial Nullstellensatz. SIAM J. Discrete Math. 27–3, 1313–1322 (2013)

    Article  MATH  Google Scholar 

  18. Wang, G., Chen, Z., Wang, J.: Neighbor sum distinguishing index of planar graphs. Discrete Math. 334, 70–73 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  19. Wang, G., Yan, G.: An improved upper bound for the neighbor sum distinguishing index of graphs. Discrete Appl. Math. 175, 126–128 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  20. Wang, W., Wang, Y.: Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree. J. Comb. Optim. 19, 471–485 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  21. Wang, W., Wang, Y.: Adjacent vertex-distinguishing edge colorings of \(K_4\)-minor free graphs. Appl. Math. Lett. 24–12, 2034–2037 (2011)

    Article  MATH  Google Scholar 

  22. Wang, T., Yu, Q.: On vertex-coloring 13-edge-weighting. Front. Math. China 3, 581–587 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  23. Zhang, Z., Liu, L., Wang, J.: Adjacent strong edge coloring of graphs. J. Appl. Math. Lett. 15, 623–626 (2002)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

This work was supported by the National Natural Science Foundation of China (71201093, 11471193,11401266,11371355), the Independent Innovation Foundation of Shandong University (IFYT14011, IFYT14012), the Foundation for Distinguished Young Scholars of Shandong Province (JQ201501) and the Fundamental Research Funds of Shandong University.

Author information

Authors and Affiliations

  1. School of Management, Shandong University, 250100, Jinan, Shandong, People’s Republic of China

    Jianghua Zhang

  2. School of Mathematics, Shandong University, 250100, Jinan, Shandong, People’s Republic of China

    Laihao Ding & Guanghui Wang

  3. Academy of Mathematics and System Sciences, Chinese Academy of Sciences, Beijing, 10080, People’s Republic of China

    Guiying Yan

  4. School of Mathematics and Statistics, Jiangsu Normal University, Xuzhou, Jiangsu, 221116, People’s Republic of China

    Shan Zhou

Authors
  1. Jianghua Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Laihao Ding
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Guanghui Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Guiying Yan
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Shan Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Guanghui Wang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, J., Ding, L., Wang, G. et al. Neighbor Sum Distinguishing Index of \(K_4\)-Minor Free Graphs. Graphs and Combinatorics 32, 1621–1633 (2016). https://doi.org/10.1007/s00373-015-1655-x

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-015-1655-x

Keywords

Search

Navigation