Some Bond Incident Degree Indices of Cactus Graphs
A connected graph in which no edge lies on more than one cycle is called a cactus graph (also known as Husimi tree). A bond incident degree (BID) index of a graph G is defined as ∑uv∈EGfdGu,dGv, where dGw denotes the degree of a vertex w of G, EG is the edge set of G, and f is a real-valued symmetri...
Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2022-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2022/8325139 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | A connected graph in which no edge lies on more than one cycle is called a cactus graph (also known as Husimi tree). A bond incident degree (BID) index of a graph G is defined as ∑uv∈EGfdGu,dGv, where dGw denotes the degree of a vertex w of G, EG is the edge set of G, and f is a real-valued symmetric function. This study involves extremal results of cactus graphs concerning the following type of the BID indices: IfiG=∑uv∈EGfidGu/dGu+fidGv/dGv, where i∈1,2, f1 is a strictly convex function, and f2 is a strictly concave function. More precisely, graphs attaining the minimum and maximum Ifi values are studied in the class of all cactus graphs with a given number of vertices and cycles. The obtained results cover several well-known indices including the general zeroth-order Randić index, multiplicative first and second Zagreb indices, and variable sum exdeg index. |
|---|---|
| ISSN: | 2314-4785 |