Cargando…
On Trees with Greatest F−Invariant Using Edge Swapping Operations
The F-index of a graph Q is defined as F(Q)=∑(t∈V(Q))(d(t))(3). In this paper, we use edge swapping transformations to find the extremal value of the F-index among the class of trees with given order, pendent vertices, and diameter. We determine the trees with given order, pendent vertices, and diam...
Autores principales: | , , , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Hindawi
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9256366/ https://www.ncbi.nlm.nih.gov/pubmed/35800700 http://dx.doi.org/10.1155/2022/8291974 |