{"id":43338,"date":"2026-09-06T09:19:59","date_gmt":"2026-09-06T09:19:59","guid":{"rendered":"https:\/\/uomosul.edu.iq\/en\/computerscience\/?p=43338"},"modified":"2026-09-06T09:19:59","modified_gmt":"2026-09-06T09:19:59","slug":"1-721","status":"publish","type":"post","link":"https:\/\/uomosul.edu.iq\/en\/computerscience\/2026\/09\/06\/1-721\/","title":{"rendered":"Master’s Thesis \u2013 Pure Mathematics \/ Department of Mathematics For the student: Nabaa Ahmed Jar-Allah Ahmed Al-Jawadi"},"content":{"rendered":"

 <\/p>\n

Master’s Thesis \u2013 Pure Mathematics \/ Department of Mathematics<\/p>\n

College of Computer Science and Mathematics<\/p>\n

For the student: Nabaa Ahmed Jar-Allah Ahmed Al-Jawadi <\/strong><\/p>\n

The Master’s thesis, titled<\/p>\n

“Graphing polynomial with fractional exponents for some special graphs <\/strong>”<\/p>\n

was defended in the discussion hall of the College of Computer Science and Mathematics at the University of Mosul on Sunday, September, 6, 2026.<\/p>\n

Student: Nabaa Ahmed Jar-Allah Ahmed Al-Jawadi <\/strong><\/p>\n

Supervised by: Asst.Dr. <\/strong>\u00a0Raghad Abdulaziz Mustafa<\/strong><\/p>\n

Abstract<\/strong><\/p>\n

This thesis investigates a fractional distance defined in terms of the ordinary distance between vertices of a nontrivial simple connected graph. Based on this distance, a graph polynomial with fractional exponents is introduced, whose coefficients count the unordered pairs of distinct vertices at each fractional distance. The corresponding Wiener index and average distance are also derived. Explicit expressions for the polynomial and these two distance-based measures are obtained for selected families of graphs. The study further examines these quantities for graphs obtained by joining a collection of vertex-disjoint graphs and by applying the Mycielski construction.<\/p>\n

 <\/p>\n

The discussion committee consists of<\/strong><\/p>\n