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/

Zendy Plus

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

Zendy Tools

Zendy Open

Let $m_GI$ denote the number of Laplacian eigenvalues of a graph $G$ in aninterval $I$ and let $\alpha(G)$ denote the independence number of $G$. In thispaper, we determine the classes of graphs that satisfy the condition$m_G[0,n-\alpha(G)]=\alpha(G)$ when $\alpha(G)= 2$ and $\alpha(G)= n-2$, where$n$ is the order of $G$. When $\alpha(G)=2$, $G \cong K_1 \nabla K_{n-m} \nablaK_{m-1}$ for some $m \geq 2$. When $\alpha(G)=n-2$, there are two types ofgraphs $B(p,q,r)$ and $B'(p,q,r)$ of order $n=p+q+r+2$, which we call thebinary star graphs. Also, we show that the binary star graphs with $p=r$ aredetermined by their Laplacian spectra.

Classification of graphs by Laplacian eigenvalue distribution and independence number