arXiv Analytics

Sign in

arXiv:1305.7305 [math.CO]AbstractReferencesReviewsResources

Skew-spectra and skew energy of various products of graphs

Xueliang Li, Huishu Lian

Published 2013-05-31Version 1

Given a graph $G$, let $G^\sigma$ be an oriented graph of $G$ with the orientation $\sigma$ and skew-adjacency matrix $S(G^\sigma)$. Then the spectrum of $S(G^\sigma)$ consisting of all the eigenvalues of $S(G^\sigma)$ is called the skew-spectrum of $G^\sigma$, denoted by $Sp(G^\sigma)$. The skew energy of the oriented graph $G^\sigma$, denoted by $\mathcal{E}_S(G^\sigma)$, is defined as the sum of the norms of all the eigenvalues of $S(G^\sigma)$. In this paper, we give orientations of the Kronecker product $H\otimes G$ and the strong product $H\ast G$ of $H$ and $G$ where $H$ is a bipartite graph and $G$ is an arbitrary graph. Then we determine the skew-spectra of the resultant oriented graphs. As applications, we construct new families of oriented graphs with maximum skew energy. Moreover, we consider the skew energy of the orientation of the lexicographic product $H[G]$ of a bipartite graph $H$ and a graph $G$.

Comments: 11 pages
Categories: math.CO
Subjects: 05C20, 05C50, 05C90
Related articles: Most relevant | Search more
arXiv:1305.3414 [math.CO] (Published 2013-05-15)
More on the skew-spectra of bipartite graphs and Cartesian products of graphs
arXiv:1806.02838 [math.CO] (Published 2018-06-07)
On TurĂ¡n exponents of bipartite graphs
arXiv:2009.06688 [math.CO] (Published 2020-09-14)
On the number of spanning trees in bipartite graphs