Searcharxiv⌕ Search

arXiv subjects

Aditya Purwa Santika

Publications and source records attributed to Aditya Purwa Santika.

3 recordsLinked to original sources

Further Results on the Quadratic Embedding Constants of Corona Graphs

The quadratic embedding constant (QEC) is a numerical invariant associated with quadratic embeddings of graphs into Hilbert spaces, and it is characterized in terms of the distance matrix. For corona graphs $G\odot H$, a general expression for $\mathrm{QEC}(G\odot H)$ can be described using $\mathrm{QEC}(G)$ together with spectral properties of $H$. However, this expression involves an additional spectral contribution determined by the adjacency matrix of $H$. In this paper, we analyze this contribution and provide an explicit description of the associated set $Γ$, allowing us to determine the quantity $γ= \max Γ$ that appears in the general formula for $\mathrm{QEC}(G\odot H)$. As applications, we compute the quadratic embedding constants for corona graphs of the form $G\odot H$ where $H$ is a regular graph. Finally, we provide conditions on $G$ and $H$ under which the quadratic embedding constant of $G\odot H$ coincides with the second largest eigenvalue of the distance matrix.

math.CO↗

Quadratic Embedding Constants of Corona Graphs

The quadratic embedding constant (QEC) of a connected graph is defined to be the maximum of the quadratic function associated with its distance matrix on a certain unit sphere of codimension two. In this paper we derive a formula for the QEC of a corona graph $G\odot H$. It is shown that $\mathrm{QEC}(G\odot H)=ψ_{H*}^{-1}(\mathrm{QEC}(G))$ holds under some spectral assumptions on $H$, where $ψ_{H*}^{-1}$ is the inverse function of the most right branch of the analytic function $ψ_H$ defined by means of the main eigenvalues of the adjacency matrix of $H$. Moreover, if $H$ is a regular graph of which the adjacency matrix has the smallest eigenvalue $-2$, then the formula is written down explicitly.

math.CO↗

Linear codes over the ring $\mathbb{Z}_4 + u\mathbb{Z}_4 + v\mathbb{Z}_4 + w\mathbb{Z}_4 + uv\mathbb{Z}_4 + uw\mathbb{Z}_4 + vw\mathbb{Z}_4 + uvw\mathbb{Z}_4$

We investigate linear codes over the ring $\mathbb{Z}_4 + u\mathbb{Z}_4 + v\mathbb{Z}_4 + w\mathbb{Z}_4 + uv\mathbb{Z}_4 + uw\mathbb{Z}_4 + vw\mathbb{Z}_4 + uvw\mathbb{Z}_4$, with conditions $u^2=u$, $v^2=v$, $w^2=w$, $uv=vu$, $uw=wu$ and $vw=wv.$ We first analyze the structure of the ring and then define linear codes over this ring. Lee weight and Gray map for these codes are defined and MacWilliams relations for complete, symmetrized, and Lee weight enumerators are obtained. The Singleton bound as well as maximum distance separable codes are also considered. Furthermore, cyclic and quasi-cyclic codes are discussed, and some examples are also provided.

cs.IT↗