ORDERING TETRACYCLIC CONNECTED GRAPHS HAVING MINIMUM DEGREE DISTANCE

Year 2025, Volume: 15 Issue: 12, 2742 - 2749, 06.12.2025

Haseeb Muzaffar Mohammad Tariq Rahim Riffat Rehman Fawad Hussain

Abstract

Degree distance is an important molecular descriptor which has gained much attention in the recent past. It provides valuable insights into the connectivity and properties of molecular graphs, making it a powerful tool in chemical graph theory. Ordering of graphs with certain parameters allows chemists to identify patterns and trends of different chemical compounds and as a result, predict their reaction behaviour accordingly. In this paper, first ten graphs are presented which have minimum degree distance in the class of tetracyclic connected graphs provided $n\ge15$, along with their values (in ascending order).

Keywords

Degree sequence , Molecular descriptor , Cyclic graphs , Ordering

Thanks

The authors would like to extend their gratitude to anonymous referees for a careful reading and insightful comments, which led to number of improvements to this paper.

References

• Dobrynin, A. A. and Kochetova, A. A., (1994), Degree distance of a graph: A degree analog of the Wiener index, Journal of Chemical Information and Computer Sciences, 34(5), pp. 1082-1086. https://doi.org/10.1021/ci00021a008.
• Tomescu, I., (1999), Some extremal properties of the degree distance of a graph, Discrete Applied Mathematics, 98(1–2), pp. 159–163. https://doi.org/10.1016/s0166-218x(99)00117-1.
• Tomescu, I., (2010), Ordering connected graphs having small degree distances, Discrete Applied Mathematics, 158(15), pp. 1714–1717. https://doi.org/10.1016/j.dam.2010.05.023.
• Tomescu, I. and Kanwal, S., (2012), Ordering connected graphs having small degree distances. II, Match-Communications in Mathematical and Computer Chemistry, 67(2), pp. 425-437.
• Tomescu, A. I., (2007), Unicyclic and bicyclic graphs having minimum degree distance, Discrete Applied Mathematics, 156(1), pp. 125–130. https://doi.org/10.1016/j.dam.2007.09.010.
• Ashrafi, A. R. and Ghalavand, A., (2017), Ordering chemical trees by Wiener polarity index, Applied Mathematics and Computation, 313, pp. 301–312. https://doi.org/10.1016/j.amc.2017.06.005.
• Ghalavand, A. and Ashrafi, A. R., (2018), Ordering chemical graphs by Randić and sum-connectivity numbers, Applied Mathematics and Computation, 331, pp. 160–168. https://doi.org/10.1016/j.amc.2018.02.049.
• Tomescu, I. and Kanwal, S., (2015), Unicyclic connected graphs having smallest degree distances, Utilitas Mathematica, 97, pp. 161-181.
• Ghalavand, A. and Ashrafi, A. R., (2019), Ordering chemical unicyclic graphs by Wiener polarity index, International Journal of Quantum Chemistry, 119(17), pp. 160-168. https://doi.org/10.1002/qua.25973.
• Ghalavand, A. and Ashrafi, A. R., (2020), Ordering of c-cyclic graphs with respect to total irregularity, Journal of Applied Mathematics and Computing, 63(1–2), pp. 707–715. https://doi.org/10.1007/s12190-020-01335-6.
• Dragan, M. and Tomescu, I., (2019), Bicyclic connected graphs having smallest degree distances, 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), pp. 105-108. https://doi.org/10.1109/SYNASC49474.2019.00023.
• Zhu, W., Hu, S. and Ma, H., (2011), A note on tricyclic graphs with minimum degree distance, Discrete Mathematics, Algorithms and Applications, 03(01), pp. 25-32. https://doi.org/10.1142/S1793830911000985.
• Muzaffar, M. H., Rahim, M. T., Rehman, R. and Hussain, F., (2025), Ordering tricyclic connected graphs having minimum degree distance, Iranian Journal of Mathematical Chemistry, 16(3), pp. 199-205. https://doi.org/10.22052/ijmc.2025.255360.1895
• Khan, N., Rahim, M. T. and Raza, Z., (2014), A note on degree distance of 4-cyclic graphs, Utilitas Mathematica, 93, pp. 109-116.