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

In this paper, we introduce central vertex corona, central edge corona, andcentral edge neighborhood corona of graphs using central graph. Also, wedetermine their adjacency spectrum, Laplacian spectrum and signless Laplacianspectrum. From our results, it is possible to obtain infinitely many pairs ofadjacency (respectively, Laplacian and signless Laplacian) cospectral graphs.As an application, we calculate the number of spanning trees and the Kirchhoffindex of the resulting graphs.

Spectra of new graph operations based on central graph