Maximal bond incident degree index for trees and unicyclic graphs with fixed diameter
Abstract
The bond incident degree index of $ G $ is defined as$ BID(G) = \sum\limits_{u_1u_2\in E(G)} f(d(u_1),d(u_2)), $where $ f(y, x) = f(x, y) $ is a real-valued function. In this paper, using graph transformation methods, we respectively established the maximum bond incident degree indices of trees and unicyclic graphs with a fixed diameter. As an application of the sufficient conditions, we verified that six bond incident degree indices satisfy such conditions, among which are the newly introduced Euler Sombor index and the computationally complex general Sombor index.
Fields of Study & Subjects
Graph theory and applications
Complex Network Analysis Techniques
Control and Stability of Dynamical Systems
Publication details
- Journal / source
- AIMS Mathematics
- Publisher
- American Institute of Mathematical Sciences (AIMS)
- Volume
- 11
- Issue
- 2
- Pages
- 4985–5005
- Publication date
- 1 January 2026