Skip to main content
SpringerLink
Log in

Injective Coloring of Product Graphs

  • Published:
Bulletin of the Malaysian Mathematical Sciences Society Aims and scope Submit manuscript

Abstract

The problem of injective coloring in graphs can be revisited through two different approaches: coloring the two-step graphs and vertex partitioning of graphs into open packing sets, each of which is equivalent to the injective coloring problem itself. Taking these facts into account, we observe that the injective coloring lies between graph coloring and domination theory. We make use of these three points of view in this paper so as to investigate the injective coloring of some well-known graph products. We bound the injective chromatic number of direct and lexicographic product graphs from below and above. In particular, we completely determine this parameter for the direct product of two cycles. We also give a closed formula for the corona product of two graphs.

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

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

Similar content being viewed by others

Data availability

No data was used for the research described in this article.

References

  1. Acharya, B.D., Vartak, M.N.: Open neighbourhood graphs, Technical Report, Research Report 7. Indian Institute of Technology Department of Mathematics, Bombay (1973)

  2. Brešar, B., Kuenzel, K., Rall, D.F.: Domination in digraphs and their direct and Cartesian products. J. Graph Theory 99, 359–377 (2022)

    Article  MathSciNet  Google Scholar 

  3. Brešar, B., Samadi, B., Yero, I.G.: Injective coloring of graphs revisited. Discrete Math. 346, 113348 (2023)

    Article  MathSciNet  Google Scholar 

  4. Brigham, R.C., Dutton, R.D.: On neighbourhood graphs. J. Comb. Inf. Syst. Sci. 12, 75–85 (1987)

    MathSciNet  Google Scholar 

  5. Chegini, A.G., Hasanvand, M., Mahmoodian, E.S., Moazami, F.: The square chromatic number of the torus. Discrete Math. 339, 447–456 (2016)

    Article  MathSciNet  Google Scholar 

  6. Cockayne, E.J., Dawes, R.M., Hedetniemi, S.T.: Total domination in graphs. Networks 10, 211–219 (1980)

    Article  MathSciNet  Google Scholar 

  7. Cockayne, E.J., Hedetniemi, S.T.: Towards a theory of domination in graphs. Networks 7, 247–261 (1977)

    Article  MathSciNet  Google Scholar 

  8. Exoo, G., Harary, F.: Step graphs. J. Comb. Inf. Syst. Sci. 5, 52–53 (1980)

    MathSciNet  Google Scholar 

  9. Ghazi, G., Rahbarnia, F., Tavakoli, M.: 2-Distance chromatic number of some graph products. Discret. Math. Algorithms Appl. 12, 2050021 (2020)

    Article  MathSciNet  Google Scholar 

  10. Hammack, R., Imrich, W., Klavžar, S.: Handbook of Product Graphs, 2nd edn. CRC Press, Boca Raton (2011)

    Book  Google Scholar 

  11. Hahn, G., Kratochvíl, J., Širáň, J., Sotteau, D.: On the injective chromatic number of graphs. Discrete Math. 256, 179–192 (2002)

    Article  MathSciNet  Google Scholar 

  12. Haynes, T.W., Hedetniemi, S.T., Henning, M.A. (eds.): Structures of Domination in Graphs, vol. 66. Springer, Cham (2021)

    Google Scholar 

  13. Haynes, T.W., Hedetniemi, S.T., Henning, M.A. (eds.): Topics in Domination in Graphs. Springer, Switzerland (2020)

    Google Scholar 

  14. Haynes, T.W., Hedetniemi, S.T., Henning, M.A.: Domination in Graphs: Core Concepts. Springer, New York (2022)

    Google Scholar 

  15. Henning, M.A., Slater, P.J.: Open packing in graphs. J. Comb. Math. Comb. Comput. 28, 5–18 (1999)

    MathSciNet  Google Scholar 

  16. Jha, P.K.: Hypercubes, Median graphs and products of graphs: some algorithmic and combinatorial results, Ph.D. Thesis, Iowa State University (1990)

  17. Jin, J., Xu, B., Zhang, X.: On the complexity of injective colorings and its generalizations. Theor. Comput. Sci. 491, 119–126 (2013)

    Article  MathSciNet  Google Scholar 

  18. Kim, B.M., Song, B.C., Rho, Y.: \(2\)-Distance colorings of some direct products of paths and cycles. Discrete Math. 338, 1730–1739 (2015)

    Article  MathSciNet  Google Scholar 

  19. Klavžar, S.: Coloring graph products-a survey. Discrete Math. 155, 135–145 (1996)

    Article  MathSciNet  Google Scholar 

  20. Kramer, F., Kramer, H.: Ein Färbungsproblem der Knotenpunkte eines Graphen bezüglich der Distanz \(p\). Rev. Roum. Math. Pures Appl. 14, 1031–1038 (1969)

    Google Scholar 

  21. Kramer, F., Kramer, H.: Un probleme de coloration des sommets d’un graphe. C.R. Acad. Sci. Paris A 268, 46–48 (1969)

    MathSciNet  Google Scholar 

  22. Lundgren, J.R., Rasmussen, C.W.: Two-step graphs of trees. Discrete Math. 119, 123–139 (1993)

    Article  MathSciNet  Google Scholar 

  23. PK, N., Kola, S.R.: The \(k\)-distance chromatic number of trees and cycles. AKCE Int. J. Graphs Comb. 16, 230–235 (2019)

    Article  MathSciNet  Google Scholar 

  24. Panda, B.S., Priyamvada: Injective coloring of some subclasses of bipartite graphs and chordal graphs. Discrete Appl. Math. 291, 68–87 (2021)

    Article  MathSciNet  Google Scholar 

  25. Shao, Z., Vesel, A.: A note on the chromatic number of the square of the Cartesian product of two cycles. Discrete Math. 313, 999–1001 (2013)

    Article  MathSciNet  Google Scholar 

  26. Sopena, É., Wu, J.: Coloring the square of the Cartesian product of two cycles. Discrete Math. 310, 2327–2333 (2010)

    Article  MathSciNet  Google Scholar 

  27. Song, J., Yue, J.: Injective coloring of some graph operations. Appl. Math. Comput. 264, 279–283 (2015)

    MathSciNet  Google Scholar 

  28. Vesel, A.: The independence number of the strong product of cycles. Comput. Math. Appl. 36(7), 9–21 (1998)

    Article  MathSciNet  Google Scholar 

  29. Vesztergombi, K.: Some remarks on the chromatic number of the strong product of graphs. Acta Cybernet. 4(2), 207–212 (1979)

    MathSciNet  Google Scholar 

  30. West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Upper Saddle River (2001)

    Google Scholar 

  31. Yue, Z., Li, Z.: Injective coloring of the Cartesian product of two cycles. Adv. Math. (China) 50, 759–771 (2021)

    MathSciNet  Google Scholar 

Download references

Acknowledgements

B. Samadi and N. Soltankhah have been supported by the Discrete Mathematics Laboratory of the Faculty of Mathematical Sciences at Alzahra University. The authors are thankful to the referees for their useful comments on the earlier version of this paper which improved its presentation.

Author information

Authors and Affiliations

  1. Department of Mathematics, Faculty of Mathematical Sciences, Alzahra University, Tehran, Iran

    Babak Samadi & Nasrin Soltankhah

  2. Departamento de Matemáticas, Universidad de Cádiz, Algeciras Campus, Algeciras, Spain

    Ismael G. Yero

Authors
  1. Babak Samadi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nasrin Soltankhah
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ismael G. Yero
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

All authors have contributed to the entire process of working on this paper and approved its final version.

Corresponding author

Correspondence to Babak Samadi.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Additional information

Communicated by Rosihan M. Ali.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Samadi, B., Soltankhah, N. & G. Yero, I. Injective Coloring of Product Graphs. Bull. Malays. Math. Sci. Soc. 47, 86 (2024). https://doi.org/10.1007/s40840-024-01682-8

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s40840-024-01682-8

Keywords

Mathematics Subject Classification

Search

Navigation