Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 239-252 |
Number of pages | 14 |
Journal | Iranian Journal of Mathematical Chemistry |
Volume | 13 |
Issue number | 4 |
DOIs | |
Publication status | Published - Dec 2022 |
Keywords
- Bipartite graph
- Diameter
- Join
- Topological index
ASJC Scopus subject areas
- General Chemistry
- Applied Mathematics