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 Tools annual

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 monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

In this paper, we use Breadth-first search algorithm to determine thedistance matrix of multiplicative circulant graph of order power of two andthree. As a consequence, the diameter of the graphs were determined. We alsogive their distance spectral radii, average distances, as well as the exactvalues of vertex-forwarding indices. Finally, using some known relationshipsbetween the distance spectral radii and forwarding indices of a graph, we givesome bounds for their edge-forwarding indices.

Distance Eigenvalues and Forwarding Indices of Multiplicative Circulant Graph of Order Power of Two and Three