Extremal results on the Mostar index of trees with fixed parameters
For a graph G , the Mostar index of G is the sum of | n u ( e ) − n v ( e ) | over all edges e = u v of G , where n u ( e ) denotes the number of vertices of G that have a smaller distance in G to u than to v , and analogously for n v ( e ) . We determine all the graphs that maximize and minimize th...
Saved in:
| Published in | Discrete mathematics, algorithms, and applications Vol. 17; no. 2 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
Singapore
World Scientific Publishing Company
01.02.2025
World Scientific Publishing Co. Pte., Ltd |
| Subjects | |
| Online Access | Get full text |
| ISSN | 1793-8309 1793-8317 |
| DOI | 10.1142/S1793830924500253 |
Cover
| Summary: | For a graph
G
, the Mostar index of
G
is the sum of
|
n
u
(
e
)
−
n
v
(
e
)
|
over all edges
e
=
u
v
of
G
, where
n
u
(
e
)
denotes the number of vertices of
G
that have a smaller distance in
G
to
u
than to
v
, and analogously for
n
v
(
e
)
. We determine all the graphs that maximize and minimize the Mostar index, respectively, over all trees in terms of some fixed parameters like the number of odd vertices, the number of vertices of degree two, and the number of pendent paths of fixed length. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 1793-8309 1793-8317 |
| DOI: | 10.1142/S1793830924500253 |