On Eccentric Adjacency Index of Graphs and Trees
Let $G=(V(G),E(G))$ be a simple and connected graph. The distance between any two vertices $x$ and $y$, denoted by $d_G(x,y)$, is defined as the length of a shortest path connecting $x$ and $y$ in $G$.The degree of a vertex $x$ in $G$, denoted by $\deg_G(x)$, is defined as the number of vertices in...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Kashan
2023-03-01
|
| Series: | Mathematics Interdisciplinary Research |
| Subjects: | |
| Online Access: | https://mir.kashanu.ac.ir/article_113761_25bbe911758dc04c41038b96ac151cd4.pdf |