On the General Eccentric Distance Sum of Graphs and Trees
نویسندگان
1 Department of Mathematical Sciences, Colleges of Science, United Arab Emirates University, Al Ain, United Arab Emirates
2 Department of Mathematics and Applied Mathematics, University of the Free State, Bloemfontein, South Africa
3 Department of Applied Mathematics, School of Applied Natural Science, Adama Science and Technology University, Adama, Ethiopia
4 Department of Applied Mathematics, School of Applied Natural Science, Adama Science and Technology University, Adama, Ethiopia
doi
10.22052/ijmc.2022.246189.1617چکیده
We obtain some sharp bounds on the general eccentric distance sum for general graphs, bipartite graphs and trees with given order and diameter 3, graphs with given order and domination number 2, and for the join of two graphs with given order and number of vertices having maximum possible degree. Extremal graphs are presented for all the bounds.
