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 $n \geq 4$. The helm graph $H_n$ on $2n-1$ vertices is obtained from thewheel graph $W_n$ by adjoining a pendant edge to each vertex of the outer cycleof $W_n$. Suppose $n$ is even. Let $D := [d_{ij}]$ be the distance matrix of$H_n$. In this paper, we first show that $\det(D) = 3(n-1)2^{n-1}.$ Next, wefind a matrix $\L$ and a vector $u$ such that \[D^{-1} =-\frac{1}{2}\L+\frac{4}{3(n-1)}uu'.\] We also prove an interlacing propertybetween the eigenvalues of $\L$ and $D$.

On distance matrices of helm graphs obtained from wheel graphs with an even number of vertices