A set of edges X⊆ E (G) of a graph G is an edge general position set if no three edges from
X lie on a common shortest path in G. The cardinality of a largest edge general position set …

Došlić et al. defined the Mostar index of a graph G as∑ uv∈ E (G)| n G (u, v)− n G (v, u)|,
where, for an edge uv of G, the term n G (u, v) denotes the number of vertices of G that have …

Fibonacci Cubes have been an extremely popular area of research since the 1990s. This
unique compendium features the state of research into Fibonacci Cubes. It expands the …

Chemical graph theory is a mixture of chemistry and mathematics both play an important
role in chemical graph theory. Chemistry provides a chemical compound and graph theory …

Daisy cubes are a class of isometric subgraphs of the hypercubes Q n. Daisy cubes include
some previously well known families of graphs like Fibonacci cubes and Lucas cubes …

Došlić et al. defined the Mostar index of a graph G as M o (G)=∑ uv∈ E (G)| n G (u, v)− n G
(v, u)|, where, for an edge uv of G, the term n G (u, v) denotes the number of vertices of G that …

Do\v {s} li\'{c} et al. defined the Mostar index of a graph $ G $ as $ Mo (G)=\sum\limits_ {uv\in
E (G)}| n_G (u, v)-n_G (v, u)| $, where, for an edge $ uv $ of $ G $, the term $ n_G (u, v) …

The Wiener index and the Mostar index quantify two distance related properties of
connected graphs: the Wiener index is the sum of the distances over all pairs of vertices and …