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 the present paper we find a simple algorithm for counting Jacobian groupof the generalized Petersen graph GP(n,k). Also, we obtain a closed formula forthe number of spanning trees of this graph in terms of Chebyshev polynomials.

On Jacobian group and complexity of the generalized Petersen graph GP(n,k) through Chebyshev polynomials