ORDERING TETRACYCLIC CONNECTED GRAPHS HAVING MINIMUM DEGREE DISTANCE

Haseeb Muzaffar; Mohammad Tariq Rahim; Riffat Rehman; Fawad Hussain

ORDERING TETRACYCLIC CONNECTED GRAPHS HAVING MINIMUM DEGREE DISTANCE

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

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.

Details

Primary Language

English

Subjects

Combinatorics and Discrete Mathematics (Excl. Physical Combinatorics)

Journal Section

Research Article

Authors

Haseeb Muzaffar ^* This is me
0009-0002-8751-0339
Pakistan

Mohammad Tariq Rahim This is me
0000-0003-3304-6518
Pakistan

Riffat Rehman This is me
0009-0006-9406-4727
Pakistan

Fawad Hussain
0000-0002-3050-8564
Pakistan

Publication Date

December 6, 2025

Submission Date

November 3, 2024

Acceptance Date

January 14, 2025

Published in Issue

Year 2025 Volume: 15 Number: 12

IZ

https://izlik.org/JA29HZ27DB

Cite

RIS / Bibtex

APA

Muzaffar, H., Rahim, M. T., Rehman, R., & Hussain, F. (2025). ORDERING TETRACYCLIC CONNECTED GRAPHS HAVING MINIMUM DEGREE DISTANCE. TWMS Journal of Applied and Engineering Mathematics, 15(12), 2742-2749. https://izlik.org/JA29HZ27DB

AMA

1.Muzaffar H, Rahim MT, Rehman R, Hussain F. ORDERING TETRACYCLIC CONNECTED GRAPHS HAVING MINIMUM DEGREE DISTANCE. JAEM. 2025;15(12):2742-2749. https://izlik.org/JA29HZ27DB

Chicago

Muzaffar, Haseeb, Mohammad Tariq Rahim, Riffat Rehman, and Fawad Hussain. 2025. “ORDERING TETRACYCLIC CONNECTED GRAPHS HAVING MINIMUM DEGREE DISTANCE”. TWMS Journal of Applied and Engineering Mathematics 15 (12): 2742-49. https://izlik.org/JA29HZ27DB.

EndNote

Muzaffar H, Rahim MT, Rehman R, Hussain F (December 1, 2025) ORDERING TETRACYCLIC CONNECTED GRAPHS HAVING MINIMUM DEGREE DISTANCE. TWMS Journal of Applied and Engineering Mathematics 15 12 2742–2749.

IEEE

[1]H. Muzaffar, M. T. Rahim, R. Rehman, and F. Hussain, “ORDERING TETRACYCLIC CONNECTED GRAPHS HAVING MINIMUM DEGREE DISTANCE”, JAEM, vol. 15, no. 12, pp. 2742–2749, Dec. 2025, [Online]. Available: https://izlik.org/JA29HZ27DB

ISNAD

Muzaffar, Haseeb - Rahim, Mohammad Tariq - Rehman, Riffat - Hussain, Fawad. “ORDERING TETRACYCLIC CONNECTED GRAPHS HAVING MINIMUM DEGREE DISTANCE”. TWMS Journal of Applied and Engineering Mathematics 15/12 (December 1, 2025): 2742-2749. https://izlik.org/JA29HZ27DB.

JAMA

1.Muzaffar H, Rahim MT, Rehman R, Hussain F. ORDERING TETRACYCLIC CONNECTED GRAPHS HAVING MINIMUM DEGREE DISTANCE. JAEM. 2025;15:2742–2749.

MLA

Muzaffar, Haseeb, et al. “ORDERING TETRACYCLIC CONNECTED GRAPHS HAVING MINIMUM DEGREE DISTANCE”. TWMS Journal of Applied and Engineering Mathematics, vol. 15, no. 12, Dec. 2025, pp. 2742-9, https://izlik.org/JA29HZ27DB.

Vancouver

1.Haseeb Muzaffar, Mohammad Tariq Rahim, Riffat Rehman, Fawad Hussain. ORDERING TETRACYCLIC CONNECTED GRAPHS HAVING MINIMUM DEGREE DISTANCE. JAEM [Internet]. 2025 Dec. 1;15(12):2742-9. Available from: https://izlik.org/JA29HZ27DB