Fork-decomposition of strong product of graphs

Authors

DOI:

https://doi.org/10.23755/rm.v48i0.1134

Keywords:

Decomposition, Fork, Product graph, Strong Product

Abstract

Decomposition of arbitrary graphs into subgraphs of small size is assuming importance in the literature. There are several studies on the isomorphic decomposition of graphs into paths, cycles, trees, stars, sunlet etc. Fork is a tree obtained by subdividing any edge of a star of size three exactly once. In this paper, we investigate the necessary and sufficient for the fork-decomposition of Strong product of graphs.

Author Biographies

  • Samuel Issacraj, Manonmaniam Sundaranar University, Tirunelveli
    Research Scholar, Department of Mathematics
  • Paulraj Joseph, Manonmaniam Sundaranar University, Tirunelveli
    Professor, Department of Mathematics

References

A. Akwu and D. Ajayi. Sunlet decomposition of certain equipartite graphs. International Journal of Combinatorics, page 4, 2013.

B. Alspach and H. Gavlas. Cycle decomposition of K_n and K_n-i,. J .Combin. Theory (B), 81:77–99, 2001.

J. Barat and D. Gerbner. Edge decomposition of graph into copies of tree with four edges. Electron. J. Combin., 21(1), 2014.

J. Barat and C. Thomassen. Claw-decompositions and tutte-orientations. J. Graph Theory, 52:135–146, 2006.

J. Bondy and U. Murty. Graph Theory, Springer International Edition. Springer, 2008.

P. C. Devi and J. P. Joseph. P_4 decomposition of product graphs. JP Journal of Mathematical Sciences, 7 (1 & 2):13–39, 2013.

D. Dor and M. Tarsi. Graph-decomposition is np-complete: a complete proof of holyer’s conjecture. SIAM J Comput, 26:1166–1187, 1997.

R. Hammack, W. Imrich, and S. Klavzar. Handbook of Product Graphs, Second Edition. Taylor and Francis Group, 2011.

A. S. Issacraj and J. P. Joseph. Fork-decomposition of cartesian product of graphs. Mapana Journal of Sciences, 22:189–204, 2023.

A. S. Issacraj and J. P. Joseph. Fork-decomposition of direct product of graphs. Advances and Applications in Discrete Mathematics, 34:39–55, 2022.

J. P. Joseph and A. S. Issacraj. Fork-decomposition of graphs. Pre-Conference Proceedings of the International Conference on Discrete Mathematics, 426–431, 2022.

C. S. Kumar. On P_4-decomposition of graphs. Taiwanese Journal of Mathematics, 7 (4):657–664, 2003.

M. qing Zhai and C. hong Lu. Path decomposition of graph with given path length. Acta Mathematicae Aplicatae Sinica, English Series, 22 (4):633–638, 2006.

C. D. Simone and A. Sassano. Stability number of bull and chair-free graphs. Discrete Applied Mathematics, 41:121–129, 1993.

Y. Zhao and B. Wu. Star decomposition of graphs. Discrete Mathematics, Algorithms and Applications, 7 (2):1550016 (9 pages), 2015.

Downloads

Published

2023-12-30

Issue

Vol. 48 (2023)

Section

Volume 48-2023

License

This journal provides immediate open access to its content on the principle that making research freely available to the public supports a greater global exchange of knowledge. The journal is committed to real and immediate open access for academic work. All of the journal articles are free to access immediately from the date of publication. There are no charge for readers to download articles and reviews for their own scholarly use. Benefits of open access for authors, include:

  • Free access for all users worldwide
  • Increased visibility and readership
  • Rapid publication
  • No spatial constraints
  • Authors can share their research papers on their personal web-pages (i.e. ResearchGate, etc.)

Ratio Mathematica publishes open access articles under the terms of the Creative Commons Attribution (CC BY) License. The Creative Commons Attribution License (CC-BY) allows users to copy, distribute and transmit an article, adapt the article and make commercial use of the article. The CC BY license permits commercial and non-commercial re-use of an open access article, as long as the author is properly attributed. Copyright on any research article published by Ratio Mathematica is retained by the author(s). Authors grant Ratio Mathematica a license to publish the article and identify itself as the original publisher. Authors also grant any third party the right to use the article freely as long as its original authors, citation details and publisher are identified. 
For further information visit: https://creativecommons.org/licenses/by/3.0/. The following logo will appear in any paper that will be published from the volume number 31/2016 onwards.