Bounds on the difference between the eccentric distance sum and the degree distance of graphs
Filomat · 2025 · 39 (20) · 7063-7075
DOI: 10.2298/fil2520063z ↗Kurz gefasst
Fachartikel in der Zeitschrift Filomat, 2025. Verfasst von Wanping Zhang und 2 weiteren Autor:innen. Die Arbeit nennt 29 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC0).
Abstract (Originalsprache)
The eccentric distance sum and degree distance have been well-studied in the past several years. More recently, many authors have considered the relationships between several distance-based graph invariants. Hua et al. [9] investigated the relationship between the eccentric distance sum ?d (G) and the degree distance D?(G) of a graph G. In this paper, we give some further results on ?d(G)-D?(G). Firstly, we determine upper and lower bounds on ?d(G)-D?(G) among general connected graphs in terms of the number of cut edges, and characterize the corresponding extremal graphs. Meanwhile, we identify the extremal graphs of given girth g having the minimum and maximum ?d (G)-D?(G). Secondly, we consider the extremal problems among bipartite graphs on ?d(G)-D?(G) in terms of matching number. And then we characterize the extremal bipartite graphs with diameter d having minimum ?d(G)-D?(G).
Zitieren
APA
Zhang, W., Wang, X., & Huang, G. (2025). Bounds on the difference between the eccentric distance sum and the degree distance of graphs. Filomat, 39(20), 7063-7075. https://doi.org/10.2298/fil2520063z
Vancouver
Zhang W, Wang X, Huang G. Bounds on the difference between the eccentric distance sum and the degree distance of graphs. Filomat. 2025;39(20):7063-7075. doi:10.2298/fil2520063z
BibTeX
@article{Zhang2025,
author = {Zhang, Wanping and Wang, Xin and Huang, Guangdi},
title = {Bounds on the difference between the eccentric distance sum and the degree distance of graphs},
journal = {Filomat},
year = {2025},
volume = {39},
number = {20},
pages = {7063--7075},
doi = {10.2298/fil2520063z}
}
EUVIMED