On Mostar and Edge Mostar Indices of Graphs
Let G be a graph with edge set EG and e=uv∈EG. Define nue,G and mue,G to be the number of vertices of G closer to u than to v and the number of edges of G closer to u than to v, respectively. The numbers nve,G and mve,G can be defined in an analogous way. The Mostar and edge Mostar indices of G are...
Saved in:
Main Authors: | Ali Ghalavand, Ali Reza Ashrafi, Mardjan Hakimi-Nezhaad |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2021-01-01
|
Series: | Journal of Mathematics |
Online Access: | http://dx.doi.org/10.1155/2021/6651220 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On the discovery of the multibracteate Silver-leaved linden in Mostar, Bosnia and Herzegovina
by: Selma Vejzagić
Published: (2022-12-01) -
Computing some Laplacian Coefficients of Forests
by: Ali Ghalavand, et al.
Published: (2022-01-01) -
On resolving edge colorings in graphs
by: Varaporn Saenpholphat, et al.
Published: (2003-01-01) -
The number of edges on generalizations of Paley graphs
by: Lawrence Sze
Published: (2001-01-01) -
On the edge set of graphs of lattice paths
by: Steven Klee, et al.
Published: (2004-01-01)