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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Let $X$ be a finite, simple graph with vertex set $V(X)$. The $2$-distancegraph $T_2(X)$ of $X$ is the graph with the same vertex set as $X$ and twovertices are adjacent if and only if their distance in $X$ is exactly $2$. Agraph $G$ is a $2$-distance graph if there exists a graph $X$ such that$T_2(X)=G$. In this paper, we give three characterizations of $2$-distancegraphs, and find all graphs $X$ such that $T_2(X)=kP_2$ or $K_m \cup K_n$,where $k \ge 2$ is an integer, $P_2$ is the path of order $2$, and $K_m$ is thecomplete graph of order $m \ge 1$.

Characterizing $2$-Distance Graphs and Solving the Equations $T_2(X)=kP_2$ or $K_m \cup K_n$