An ordered set W of vertices in a graph G is said to resolve G if every vertex in G is uniquely
determined by its vector of distances to the vertices in W. A resolving set containing a …

For a connected graph G, a subset W={w 1, w 2, w 3,…, wξ} of the vertices of G is the
resolving set for G if for a, b∈ V (G), we have d (a, wξ)≠ d (b, wξ) for all wξ∈ W. Metric basis …

The theory of chemical reaction networks is a branch of mathematical sciences that aims to
simulate real world behavior. This has received increasing attention of researchers, primarily …

If every edge in the graph G is also an edge of a subgraph of G isomorphic to a given graph
H we say that the graph G admits an H-covering. Let G be a graph admitting an H-covering …

The Weiner index is considered one of the basic descriptors of fixed interconnection
networks because it provides the average distance between any two nodes of the network …

Given a graph G consisting of vertex set V and edget set E, repectively. Assume G is simple,
connected, and the edges do not have direction. A function λ that maps V∪ E into a set of κ …

Given a graph G (V, E) which consists of the sets V (set of vertices) and E (set of edges),
respectively. In this article, we study the “vertex irregular total k-labeling” of G and the “total …