Diametral Trees Decomposition of Helm Graph

Anwar Nasif Jasim; Mohsin  N. Yasir

doi:10.31642/JoKMC/2018/130215

Authors

Anwar Nasif Jasim Department of Mathematics, Faculty of CS and Mathematics University of Kufa, Iraq
Mohsin N. Yasir Department of Mathematics, Faculty of CS and Mathematics University of Kufa, Iraq

DOI:

https://doi.org/10.31642/JoKMC/2018/130215

Keywords:

Graph decomposition, Diametral path, Diametral tree decomposition, Helm graph

Abstract

Because it helps solve numerous issues and offers insights into the graph's structure, studying the diametral path is crucial for network research and design. Graph decomposition, which splits complex graphs into smaller components, is a crucial area of research in graph theory. It helps facilitate the study and understanding of the graph's features. A set of discrete subgraphs covering the set of edges in a graph G is called a partition. Decomposition using trees to link every vertex or diametral paths that can exist between any two vertices in a graph is still widely studied. As a result, many computationally challenging graph problems become straightforward if the graph is a tree. In this paper, we introduce novel concepts in graph decomposition like diametral tree decomposition , diametral tree decomposition number and diametral tree decomposition index of the helm graph

Downloads

Download data is not yet available.

References

[1] A. N. Jasim and A. A. Najim, "Solving Edges Deletion Problem of Complete Graphs," Baghdad Science Journal, vol. 21, no. 12, pp. 4073-4082, 2024, doi: https://doi.org/10.21123/bsj.2024.10128.

[2] A. B. Adcock, B. D. Sullivan and Michael W., “ Mahoney, "Tree decompositions and social graphs," Internet Math., vol. 12, no. 5, pp. 315-361, 2016, doi: https://doi.org/10.1080/15427951.2016.1182952.

[3] J. K. Fichte, M. Hecher, M. Morak and Stefan Woltran, " Dynamic Programming on Tree Decompositions in Action, International Symposium on Parameterized and Exact Computation (IPEC)" vol.- 89, no.-17, 2017, pp 17:1-17:13, doi: https://doi.org/10.4230/LIPIcs.IPEC.2017.17.

[4] A. Sinha, S. K.Saha and P. Basuchowdhuri, "An algorithm for the decomposition of complete graph into minimum number of edge disjoint trees," arXiv preprint arXiv:2405.18506, 2024, doi: https://doi.org/10.48550/arXiv.2405.18506.

[5] F. Botler, "Decomposition of graphs into trees with bounded maximum degree," Matemática Contemporânea, vol. 46, pp. 94-102, 2019, doi: http://doi.org/10.21711/231766362020/rmc469.

[6] P. Lakshmanan, I. Maniprakasam and M. Appu, "Multidecomposition of complete graphs into cycles and claws," Journal of Algebra Combinatorics Discrete Structures and Applications, vol.13, no.2, pp.131-141, 2026, doi: https://doi.org/10.13069/jacodesmath.v13i2.271.

[7] C. S. Kumar, "on P4-decomposition of graphs ," Taiwanese Journal Mathematical , vol.7, no. 4, pp. 657 - 664, 2003,doi: https://doi.org/10.11650/twjm/1500407584.

[8] S. Yamamoto, H. Ikeda, S. Shige-eda, K. Ushio and N. Hamada, "On claw-decomposition of complete graphs and complete bigraphs, " Hiroshima Mathematical Journal, vol.5 ,no. 1 , pp.33-42, 1975, doi: https://doi.org/10.32917/hmj/1206136782.

[9] M. M. Belavadi and T. A. Mangam, "Platt number of total graphs," International Journal of Applied Mathematics, vol. 31, no.5 , pp. 593-602, 2018, doi: http://dx.doi.org/10.12732/ijam.v31i5.5 .

[10] A. N. Jasim and H. R. Hashim, "Decompositions of hypercube graphs into diametral paths and cycle decompositions," Journal of Mathematics and Statistics Studies, vol. 6, no. 1, pp. 13-17, 2025. doi: https://doi.org/10.32996/jmss.2025.6.1.2.

[11] T. Fujita, "Tree-decomposition on fuzzy graph," preprint (ResearchGate), 2024, doi: https://doi.org/10.19139/soic-2310-5070-3117.

[12] A.N. Jasim, "On the maximum diameter of graphs," Passer Journal of Basic and Applied Sciences, vol. 7, no. 2, pp. 729-732, 2025, doi: https://doi.org/10.24271/psr.2025.499398.1897.

[13] R. Diestel, "Graph Theory," Fifth Edition, Springer, Berlin, Heidelberg, Graduate Texts in Mathematics, vol. 173, pp. 1-428, 2017, doi: http://doi:10.1007/978-3-662-53622-3.

[14] A. N. Jasim and A. A. Najim, "Edges deletion problem of hypercube graphs for some n," Discrete Mathematics, Algorithms and Applications, vol. 17, no. 3, pp. 2450045, 2025, doi: https://doi.org/10.1142/S1793830924500459.

[15] B. Freyberg and R. Peters, "Decomposition of complete graphs into forests with six edges," Discuss. Mathematical. Graph Theory, vol. 45, no. 2, p. 677, 2025, doi: https://doi.org/10.7151/dmgt.2554.

[16] J. Allagan and K. Pereyra, "Hall numbers of complete multipartite graphs, 2-trees, and wheels, " Utilitas Mathematica, vol. 127, pp. 129-139, 2026, doi: https://doi.org/10.61091/um127-09.

[17] M. T. Agnes, L. S. Reddy and J. Varghese and J. S. Mangam, "Decomposition of graph into diametral paths," Bulletin of International Mathematical Virtual Institute, vol. 6, no. 2, pp. 209-216, 2016.

[18] K. Karunanayake, A. Perera, K. Dhananjaya and A. Perera, "Reconstruction of helm graph and web graph," Journal of Sci. of the Uni. of Kelaniya, vol. 13, no. 1, pp. 31-39 , 2022, doi: http://doi.org/10.4038/jsc.v13i1.41.