Abstract
Given any simple graph G, we introduce a new distance degree based index the first eccentric-degree index ED1(G) =∑uv∈E(G)[e(u)d(u)+ e(v)d(v)], and compute the same for certain special class of graphs. Further, this work is extended towards defining the first eccentric-degree energy where in we investigate the bounds for any simple graph and compute the energy for complete bipartite and complete graphs.
| Original language | English |
|---|---|
| Pages (from-to) | 29-40 |
| Number of pages | 12 |
| Journal | Global and Stochastic Analysis |
| Volume | 12 |
| Issue number | 1 |
| Publication status | Published - 01-2025 |
All Science Journal Classification (ASJC) codes
- Statistics and Probability
- Discrete Mathematics and Combinatorics
Fingerprint
Dive into the research topics of 'FIRST ECCENTRIC-DEGREE INDEX AND IT’S ENERGY FOR SOME CLASSES OF GRAPHS'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver