English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Graph theory is widely used to analyze the structure models in chemistry, biology, computer science, operations research and sociology. Molecular bonds, species movement between regions, development of computer algorithms, shortest spanning trees in weighted graphs, aircraft scheduling and exploration of diffusion mechanisms are some of these structure models. Let <inline-formula> <tex-math notation="LaTeX">$G = (V_{G}, E_{G})$ </tex-math></inline-formula> be a connected graph, where <inline-formula> <tex-math notation="LaTeX">$V_{G}$ </tex-math></inline-formula> and <inline-formula> <tex-math notation="LaTeX">$E_{G}$ </tex-math></inline-formula> represent the set of vertices and the set of edges respectively. The idea of the edge version of metric dimension is based on the distance of edges in a graph. Let <inline-formula> <tex-math notation="LaTeX">$R_{E_{G}}$ </tex-math></inline-formula> be the smallest set of edges in a connected graph <inline-formula> <tex-math notation="LaTeX">$G$ </tex-math></inline-formula> that forms a basis such that for every pair of edges <inline-formula> <tex-math notation="LaTeX">$e_{1},e_{2}~\in ~E_{G}$ </tex-math></inline-formula>, there exists an edge <inline-formula> <tex-math notation="LaTeX">$e~\in ~R_{E_{G}}$ </tex-math></inline-formula> for which <inline-formula> <tex-math notation="LaTeX">$d_{E_{G}}(e_{1}, e)~\neq ~d_{E_{G}}(e_{2}, e)$ </tex-math></inline-formula> holds. In this paper, we show that the family of circulant graphs <inline-formula> <tex-math notation="LaTeX">$C_{n}(1,2)$ </tex-math></inline-formula> is the family of graphs with constant edge version of metric dimension.

The Edge Version of Metric Dimension for the Family of Circulant Graphs Cₙ(1, 2)