# Minimal skew energy of oriented unicyclic graphs with a perfect matching

- Jian-ming Zhu
^{1}Email author and - Ju Yang
^{2}

**2014**:486

https://doi.org/10.1186/1029-242X-2014-486

© Zhu and Yang; licensee Springer. 2014

**Received: **18 July 2014

**Accepted: **25 November 2014

**Published: **8 December 2014

## Abstract

Let ${G}^{\sigma}$ be an oriented graph of a simple undirected graph *G* with an orientation *σ*, which assigns to each edge of *G* a direction so that the resultant graph ${G}^{\sigma}$ becomes a directed graph. The skew energy of ${G}^{\sigma}$ is defined as the sum of the absolute values of all eigenvalues of the skew-adjacency matrix of ${G}^{\sigma}$. Denote by ${U}^{\sigma}(2k)$ the set of all oriented unicyclic graphs on 2*k* vertices with a perfect matching which contain no cycle of length *l* with $l\equiv 2(mod4)$. In this paper, we characterize the oriented graphs of ${U}^{\sigma}(2k)$ with the minimal skew energy for $k\ge 4$.

**MSC:**05C50, 15A30.

### Keywords

skew energy eigenvalue characteristic polynomial## 1 Introduction

Let *G* be a simple undirected graph on *n* vertices and $A(G)$ be its adjacency matrix. Let $Sp(G)=\{{\lambda}_{1},{\lambda}_{2},\dots ,{\lambda}_{n}\}$ be the spectrum of $A(G)$. Then the energy of *G*, denoted by $E(G)$, is defined as $E(G)={\sum}_{i=1}^{n}|{\lambda}_{i}|$ (see [1]). The theory of graph energy is well developed nowadays. Its details can be found in the review [2] and recent book [3], and the references therein.

The skew energy of oriented graphs is a generalization for graph energy. First of all, we recall some definitions and notations. Let ${G}^{\sigma}$ be an oriented graph of a simple undirected graph *G* with the orientation *σ*, which assigns to each edge of *G* a direction so that the resultant graph ${G}^{\sigma}$ becomes an oriented graph or a directed graph. Then *G* is called the underlying graph of ${G}^{\sigma}$.

The skew-adjacency matrix $S({G}^{\sigma})=({s}_{ij})$ of ${G}^{\sigma}$ is a real skew symmetric matrix, where ${s}_{ij}=1$ and ${s}_{ji}=-1$ if $\overrightarrow{ij}$ is an arc of ${G}^{\sigma}$, otherwise ${s}_{ij}={s}_{ji}=0$. The skew-spectrum $Sp({G}^{\sigma})$ of ${G}^{\sigma}$ is defined as the spectrum of $S({G}^{\sigma})$. Note that $Sp({G}^{\sigma})$ consists of only purely imaginary eigenvalues because $S({G}^{\sigma})$ is real skew symmetric. Shader and So [4] first studied the skew-spectrum of oriented graphs and obtained some results.

Analogous to the definition of the energy of a simple undirected graph, the skew energy of an oriented graph ${G}^{\sigma}$, proposed first by Adiga *et al.* [5] and denoted by ${E}_{s}({G}^{\sigma})$, is defined as the sum of the absolute values of all eigenvalues of $S({G}^{\sigma})$, that is, ${E}_{s}({G}^{\sigma})={\sum}_{i=1}^{n}|{s}_{i}|$, where ${s}_{1},{s}_{2},\dots ,{s}_{n}$ are all the eigenvalues of $S({G}^{\sigma})$. Recently, the skew energy of oriented graphs has been studied in [5–12].

*n*can be expressed by the following integral formula [8]:

Note that ${a}_{0}({G}^{\sigma})=1$ and ${a}_{2}({G}^{\sigma})$ equals the number of the edges of *G*. It follows that ${E}_{s}({G}^{\sigma})$ is a strictly monotonically increasing function of those numbers ${a}_{2i}({G}^{\sigma})$ ($i=1,\dots ,\lfloor \frac{n}{2}\rfloor $) for any oriented graphs. This in turn provides a way of comparing the skew energies of a pair of oriented graphs as follows.

**Definition 1.1** Let ${G}_{1}^{{\sigma}_{1}}$ and ${G}_{2}^{{\sigma}_{2}}$ be two oriented graphs of order *n*. If ${a}_{2i}({G}_{1}^{{\sigma}_{1}})\le {a}_{2i}({G}_{2}^{{\sigma}_{2}})$ for all *i* with $1\le i\le \lfloor \frac{n}{2}\rfloor $, then we write ${G}_{1}^{{\sigma}_{1}}\u2aaf{G}_{2}^{{\sigma}_{2}}$.

*j*such that ${a}_{2j}({G}_{1}^{{\sigma}_{1}})<{a}_{2j}({G}_{2}^{{\sigma}_{2}})$, then we write that ${G}_{1}^{{\sigma}_{1}}\prec {G}_{2}^{{\sigma}_{2}}$. If ${a}_{2i}({G}_{1}^{{\sigma}_{1}})={a}_{2i}({G}_{2}^{{\sigma}_{2}})$ for all

*i*, we write ${G}_{1}^{{\sigma}_{1}}\sim {G}_{2}^{{\sigma}_{2}}$. According to the integral formula (2), we have for two oriented graphs ${G}_{1}^{{\sigma}_{1}}$ and ${G}_{2}^{{\sigma}_{2}}$ of order

*n*that

One of fundamental questions that is encountered in the study of skew energy is which oriented graphs from a given class have the maximal and minimal skew energy. In [4], Shader and So showed that $Sp({T}^{\sigma})=iSp(T)$ for any *n*-vertex oriented tree ${T}^{\sigma}$, and thus ${E}_{s}({T}^{\sigma})=E(T)$ which implies that ${E}_{s}({S}_{n}^{\sigma})\le {E}_{s}({T}^{\sigma})\le {E}_{s}({P}_{n}^{\sigma})$, where ${S}_{n}^{\sigma}$ and ${P}_{n}^{\sigma}$ denote an oriented star and an oriented path with any orientation, respectively.

Using the method of quasi-order defined as above, some oriented graphs from a given class which have the maximal or minimal skew energy have been further characterized. Hou *et al.* [8] determined the oriented unicyclic graphs with the maximal and minimal skew energies. Zhu [12] further characterized the oriented unicyclic graphs with the first $\lfloor \frac{n-9}{2}\rfloor $ largest skew energies. Shen *et al.* [10] determined the oriented bicyclic graphs with the maximal and minimal skew energies. Recently, Gong *et al.* [6] determined the oriented connected graph on *n* vertices with *m* ($n\le m\le 2(n-2)$) arcs which have the minimal skew energy.

In this paper, we first present some recurrence relations of the skew characteristic polynomials of oriented graphs in Section 2. By using these recurrence relations, we then provide a new technique to compare the skew energies of a class of oriented graphs which can tackle the quasi-order incomparable problems in Section 3. Denote by ${U}^{\sigma}(2k)$ the set of all oriented unicyclic graphs on 2*k* vertices with a perfect matching which contain no cycle of length *l* with $l\equiv 2(mod4)$. We finally characterize the oriented graphs of ${U}^{\sigma}(2k)$ with the minimal skew energy for $k\ge 4$ in Section 4.

## 2 Some recurrence relations of the skew characteristic polynomials of oriented graphs

In this section, we will show some recurrence relations of the skew characteristic polynomials of oriented graphs which will be used in the next section.

Let ${G}^{\sigma}$ be an oriented graph and *C* be an undirected even cycle of *G*. Then *C* is said to be evenly oriented relative to the orientation *σ* if it has an even number of edges oriented in clockwise direction (and now it also has even number of edges oriented in anticlockwise direction, since *C* is an even cycle). Otherwise *C* is said to be oddly oriented.

A linear subgraph *L* of *G* is a disjoint union of some edges and some cycles in *G*. We call a linear subgraph *L* of *G* evenly linear if *L* contains no odd cycle. We denote by ${\mathcal{EL}}_{2i}(G)$ the set of all evenly linear subgraphs of *G* with 2*i* vertices. For an evenly linear subgraph $L\in {\mathcal{EL}}_{2i}(G)$, we denote by ${p}_{e}(L)$ the number of evenly oriented cycles in *L* relative to the orientation *σ*.

The following lemma characterizes the coefficients of skew characteristic of an oriented graph, which is analogous to the famous Sachs theorem [13] for an undirected graph.

**Lemma 2.1** ([7])

*Let*${G}^{\sigma}$

*be an oriented graph with the skew characteristic polynomial*${\varphi}_{s}({G}^{\sigma},x)={\sum}_{i=0}^{\lfloor \frac{n}{2}\rfloor}{a}_{2i}({G}^{\sigma}){x}^{n-2i}$.

*Then*

*where* ${p}_{e}(L)$ *is the number of evenly oriented cycles of* *L* *and* $c(L)$ *is the number of even cycles of* *L*, *respectively*.

For convenience, we write ${\varphi}_{s}({G}^{\sigma})={\varphi}_{s}({G}^{\sigma},x)$ in what follows. From Lemma 2.1, we can get the recurrence relation of ${\varphi}_{s}({G}^{\sigma})$ as follows.

**Theorem 2.1**

*Let*

*v*

*be a vertex of*${G}^{\sigma}$.

*Then*

*where* $Od({G}^{\sigma})$ *and* $Ev({G}^{\sigma})$ *denote the sets of all oddly oriented cycles and evenly oriented cycles of* ${G}^{\sigma}$, *respectively*.

*Proof* The proof is similar to the proof of Theorem 2.4 in [7]. □

Using Theorem 2.1, we can easily derive the following corollary.

**Corollary 2.1**

*Let*

*v*

*be a vertex of*${G}^{\sigma}$

*that is on no even cycle in*${G}^{\sigma}$.

*Then*

The coalescence of two oriented graphs ${G}^{\sigma}$ and ${H}^{\tau}$ with respect to vertex *u* in ${G}^{\sigma}$ and vertex *v* in ${H}^{\tau}$, denoted by ${G}_{u}^{\sigma}\cdot {H}_{v}^{\tau}$ (sometimes abbreviated as ${G}^{\sigma}\cdot {H}^{\tau}$), is the oriented graph obtained by identifying the vertices *u* and *v*. From Theorem 2.1, we can deduce the recurrence relation of ${\varphi}_{s}({G}^{\sigma}\cdot {H}^{\tau})$ as follows.

**Theorem 2.2**

*Proof*By using (4) we can get

Thus we complete the proof. □

## 3 A new technique for comparing the skew energies of two oriented *k*-sun attaching graphs

In [14], Shan and Shao presented a new technique of directly comparing the energies of two *k*-claw attaching bipartite graphs. In this section, we apply the main idea of this technique to compare the skew energies of oriented graphs. Then we will present a new technique for comparing the skew energies of two oriented *k*-sun attaching graphs.

*k*-sun (see Figure 1), which can be obtained by inserting a new vertex on each edge of the star ${S}_{k+1}$.

The coalescence of two graphs *G* and *H* with respect to vertex *u* in *G* and vertex *v* in *H*, denoted by ${G}_{u}\cdot {H}_{v}$ (sometimes abbreviated as $G\cdot H$), is the graph obtained by identifying the vertices *u* and *v*. In particular, if *H* is the *k*-sun and *v* is the vertex of degree *k*, then we write $G\cdot H={G}_{u}(k)$, which is called the *k*-sun attaching graphs at *u*, see Figure 1. For any orientations ${\sigma}_{1}$, ${\sigma}_{2}$, ${\tau}_{1}$ and ${\tau}_{2}$, for the sake of simplicity, we always write ${G}_{u}^{{\sigma}_{1}}\cdot {(S{u}_{k})}^{{\sigma}_{2}}={({G}_{u}(k))}^{\sigma}={G}_{u}^{\sigma}(k)$ and ${H}_{v}^{{\tau}_{1}}\cdot {(S{u}_{k})}^{{\tau}_{2}}={({H}_{v}(k))}^{\tau}={H}_{v}^{\tau}(k)$.

From Theorem 2.2, we can get the recurrence relations of ${\varphi}_{s}({G}_{u}^{\sigma}(k))$ and ${\varphi}_{s}({H}_{u}^{\tau}(k))$ in what follows.

**Lemma 3.1**

*Proof*By Theorem 2.2 we have

Applying (10) to (9), we can obtain (7). Similarly, we can show (8). Then the results hold. □

It is easily checked that $D\cup {D}^{c}=(0,+\mathrm{\infty})$.

Under the above notations, we have the following properties for the functions ${s}_{k}(x)$ and $s(x)$.

**Lemma 3.2**

*Let*$x>0$

*be fixed*.

*Then*,

*for all*$0\le l<k$,

*we have the following*.

- (1)
*If*$x\in D$,*then*$s(x)<{s}_{k}(x)<{s}_{l}(x)$. - (2)
*If*$x\in {D}^{c}$,*then*$s(x)\ge {s}_{k}(x)\ge {s}_{l}(x)$.

*Proof*Using the definitions and some simple calculations, we can deduce that

Then the results follow easily from (11) and (12). □

The following result [12] illustrates an integral formula for the difference of the skew energies of two oriented graphs with the same order.

**Lemma 3.3**

*Let*${\varphi}_{s}({H}^{\tau},x)$

*and*${\varphi}_{s}({G}^{\sigma},x)$

*be two skew characteristic polynomials of two oriented graphs*${H}^{\tau}$

*and*${G}^{\sigma}$

*with the same order*.

*Then*

*G*and

*H*have the same order. From Lemma 3.3, we have

Combining Lemma 3.2 and Lemma 3.3, we can present a new technique for comparing the skew energies of two oriented *k*-sun attaching graphs in the following theorem.

**Theorem 3.1**

*Let*

*D*, ${D}^{c}$, ${s}_{k}(x)$

*and*$s(x)$

*be defined as above*.

*Then*,

*for*$0\le l<k$,

*Proof*Using (13) we have

The result easily follows from Lemma 3.2. □

## 4 Minimal skew energy of oriented unicyclic graphs with a perfect matching

In this section, we always assume that the order of a graph is $n=2k$. A *k*-matching is a disjoint union of *k* edges in *G*. The number of *k*-matchings is denoted by $m(G,k)$. We agree that $m(G,0)=1$ and $m(G,k)=0$ ($k<0$).

With regard to the coefficients ${a}_{2i}({G}^{\sigma})$ of an oriented unicyclic graph, Hou *et al.* [8] got the following lemma.

**Lemma 4.1** ([8])

*Let*${G}^{\sigma}\in {U}^{\sigma}(2k)$

*and*${C}_{l}$

*be the unique cycle of*

*G*.

*Then we have*:

- (1)
*If**l**is odd*,*then*${a}_{2i}({G}^{\sigma})=m(G,i)$. - (2)
*If**l**is even and*${C}_{l}$*is oddly oriented*,*then*${a}_{2i}({G}^{\sigma})=m(G,i)+2m(G-{C}_{l},i-\frac{l}{2})$. - (3)
*If**l**is even and*${C}_{l}$*is evenly oriented*,*then*${a}_{2i}({G}^{\sigma})=m(G,i)-2m(G-{C}_{l},i-\frac{l}{2})$.

From Lemma 4.1, we can see that the skew energy of ${G}^{\sigma}$ is independent of the orientation *σ* when *l* is odd. Thus, for convenience, we write ${G}^{\ast}$ as ${G}^{\sigma}$ when *l* is odd. Furthermore, when *l* is even and ${C}_{l}$ is oddly oriented relative to *σ*, we write ${G}^{+}$ as ${G}^{\sigma}$. When *l* is even and ${C}_{l}$ is evenly oriented relative to *σ*, we write ${G}^{-}$ as ${G}^{\sigma}$.

*k*vertices with a perfect matching which contain no cycle of length

*l*with $l\equiv 2(mod4)$. Let ${A}_{1}$, ${B}_{1}$, ${B}_{2}$, ${B}_{3}$ be the unicyclic graphs as shown in Figure 2. The following theorem is the main result of this section.

**Theorem 4.1** *Let* ${G}^{\sigma}\in {U}^{\sigma}(2k)$ *and* $k\ge 4$. *If* ${G}^{\sigma}\ne {B}_{2}^{-}$, *then* ${E}_{s}({B}_{2}^{-})<{E}_{s}({G}^{\sigma})$.

In order to prove Theorem 4.1, we first outline the basic strategy of the proof. We classify the graphs in $U(2k)$ into the following classes. Let $B(2k)$ = {$G\in U(2k)\mid $ the length of the unique cycle of *G* is divisible by 4} and $A(2k)=U(2k)\mathrm{\setminus}B(2k)$.

Denote by $K(G)$ the number of perfect matchings of a graph *G*. We first quote the following basic property about the number of perfect matchings of unicyclic graphs.

**Lemma 4.2** ([15])

*Let* $G\in U(2k)$. *Then* $K(G)=1$ *or* $K(G)=2$.

Next, in order to further classify the graphs in $D(2k)$ into two classes, we introduce some notations in what follows.

Throughout this paper, we denote by $M(G)$ a perfect matching of a graph *G*. Let $\stackrel{\u02c6}{G}=G-M(G)-{S}_{0}$, where ${S}_{0}$ is the set of isolated vertices in $G-M(G)$. We call $\stackrel{\u02c6}{G}$ the capped graph of *G* and *G* the original graph of $\stackrel{\u02c6}{G}$.

*G*. Let $G\in D(2k)$. Then $K(G)=2$. Since a tree contains at most one perfect matching, we can see that $\mathcal{E}(G-{C}_{l})\cap \mathcal{E}(\stackrel{\u02c6}{G})$ are the same under two different perfect matchings of

*G*. Thus we can classify the graphs in $D(2k)$ into the following two classes:

and ${A}_{1}\in A(2k)$, ${B}_{1}\in {B}_{1}(2k)$, ${B}_{2}\in {B}_{2}(2k)$ and ${B}_{3}\in {B}_{3}(2k)$.

For $k\ge 4$, our basic strategy of the proof of Theorem 4.1 is to prove the following results (R_{1})-(R_{3}) later:

_{1})

- (1)
${E}_{s}({B}_{2}^{-})<{E}_{s}({A}_{1}^{\ast})$.

- (2)
${E}_{s}({B}_{2}^{-})<{E}_{s}({B}_{1}^{-})$.

- (3)
${E}_{s}({B}_{2}^{-})<{E}_{s}({B}_{3}^{-})$.

(R_{2}) Let ${G}^{\sigma}\in {A}^{\sigma}(2k)$. If ${G}^{\sigma}\ne {A}_{1}^{\ast}$, then ${E}_{s}({A}_{1}^{\ast})<{E}_{s}({G}^{\sigma})$.

_{3})

- (1)
Let ${G}^{\sigma}\in {B}_{1}^{\sigma}(2k)$. If ${G}^{\sigma}\ne {B}_{1}^{-}$, then ${E}_{s}({B}_{1}^{-})<{E}_{s}({G}^{\sigma})$.

- (2)
Let ${G}^{\sigma}\in {B}_{2}^{\sigma}(2k)$. If ${G}^{\sigma}\ne {B}_{2}^{-}$, then ${E}_{s}({B}_{2}^{-})<{E}_{s}({G}^{\sigma})$.

- (3)
Let ${G}^{\sigma}\in {B}_{3}^{\sigma}(2k)$. If ${G}^{\sigma}\ne {B}_{3}^{-}$, then ${E}_{s}({B}_{3}^{-})<{E}_{s}({G}^{\sigma})$.

It is easy to see that we can prove Theorem 4.1 by combining the above results (R_{1})-(R_{3}). We will prove the results (R_{1})-(R_{3}) in Sections 4.1 to 4.3, respectively.

### 4.1 The proof of (R_{1})

By some simple calculations, we find that ${A}_{1}^{\ast}$ and ${B}_{2}^{-}$, ${B}_{1}^{-}$ and ${B}_{2}^{-}$, ${B}_{3}^{-}$ and ${B}_{2}^{-}$ are all quasi-order incomparable. We first prove the results (2) and (3) of (R_{1}) by Theorem 3.1.

**Lemma 4.3** *If* $k\ge 3$, *then* ${E}_{s}({B}_{2}^{-})<{E}_{s}({B}_{1}^{-})$.

*Proof*Let ${B}_{2}^{-}={H}_{v}^{-}(k-3)$ and ${B}_{1}^{-}={G}_{u}^{-}(k-3)$ (see Figure 2). By some simple calculations, we have

Then ${E}_{s}({B}_{2}^{-})<{E}_{s}({B}_{1}^{-})$. □

**Lemma 4.4** *If* $k\ge 4$, *then* ${E}_{s}({B}_{2}^{-})<{E}_{s}({B}_{3}^{-})$.

*Proof*Let ${B}_{2}^{-}={H}_{v}^{-}(k-3)$ and ${B}_{3}^{-}={G}_{u}^{-}(k-3)$ (see Figure 2). By some simple calculations we have

When $k=4$ and $k=5$, we can have ${E}_{s}({B}_{2}^{-})<{E}_{s}({B}_{3}^{-})$ by some simple calculations. Consequently, ${E}_{s}({B}_{2}^{-})<{E}_{s}({B}_{3}^{-})$ for $k\ge 4$. □

By computing, we find that we cannot show that ${E}_{s}({B}_{2}^{-})<{E}_{s}({A}_{1}^{\ast})$ by the above method. Thus we use an alternate method to prove the result.

**Lemma 4.5** *If* $k\ge 3$, *then* ${E}_{s}({B}_{2}^{-})<{E}_{s}({A}_{1}^{\ast})$.

*Proof*When $k=3,4,5$, we can get ${E}_{s}({B}_{2}^{-})<{E}_{s}({A}_{1}^{\ast})$ by some direct calculations. Then in what follows we assume that $k\ge 6$. By Corollary 2.1 we have

where $f(\lambda )={\lambda}^{2}-(k+2)\lambda +1$ and $g(\lambda )={\lambda}^{3}-(k+4){\lambda}^{2}+4k\lambda -6$.

In fact, it is easily checked that $\frac{17}{4}{k}^{2}-18k+4>0$ for $k\ge 6$, which implies (14). Thus we have completed the proof. □

*Proof of (R*_{
1
}*)* The result can be directly derived from Lemmas 4.3, 4.4 and 4.5. □

### 4.2 The proof of (R_{2})

Let $G\in U(2k)$. Firstly, we show a method of computing the matching number of *G*. It is easy to see that $\mathcal{E}(G)=\mathcal{E}(\stackrel{\u02c6}{G})\cup M(G)$. Thus each *i*-matching Ω of *G* can be partitioned into two parts: $\mathrm{\Omega}=\mathrm{\Phi}\cup \mathrm{\Psi}$, where $\mathrm{\Phi}\subseteq \mathcal{E}(\stackrel{\u02c6}{G})$ and $\mathrm{\Psi}\subseteq M(G)$. Let ${r}_{j}^{(2i)}(G)$ be the number of ways to choose *i* independent edges in *G* such that just *j* edges are in $\stackrel{\u02c6}{G}$. For example, ${r}_{0}^{(2i)}(G)=\left(\begin{array}{c}k\\ i\end{array}\right)$ and ${r}_{1}^{(2i)}(G)=k\left(\begin{array}{c}k-2\\ i-1\end{array}\right)$.

where $p=\left(\begin{array}{c}k\\ i\end{array}\right)+k\left(\begin{array}{c}k-2\\ i-1\end{array}\right)$.

*Proof of (R*_{
2
}*)* Let ${G}^{\sigma}\in {A}^{\sigma}(2k)$. By Lemma 4.1 we have ${a}_{2i}({G}^{\sigma})=m(G,i)$. Furthermore, since ${\stackrel{\u02c6}{A}}_{1}$ is a star of order $k+1$, we have ${\sum}_{j=2}^{i}{r}_{j}^{(2i)}({A}_{1})=0$. From Lemma 4.1 we can deduce that ${a}_{2i}({A}_{1}^{\ast})=m({A}_{1},i)=p\le m(G,i)={a}_{2i}({G}^{\sigma})$. Because $G\ne {A}_{1}$, ${a}_{4}({A}_{1}^{\ast})<{a}_{4}({G}^{\sigma})$ implying that ${E}_{s}({A}_{1}^{\ast})<{E}_{s}({G}^{\sigma})$. □

### 4.3 The proof of (R_{3})

We firstly quote and prove some lemmas which will be used in the proof of (R_{3}).

**Lemma 4.6** *Let* *G* *be a unicyclic graph of order* *n* *and* ${C}_{l}$ *be the unique cycle of* *G*. *If* $l\equiv 0(mod4)$, *then* $E(G)={E}_{s}({G}^{-})$.

*Proof*Since $l\equiv 0(mod4)$,

*G*is a bipartite unicyclic graph. Then we can assume that the characteristic polynomial of

*G*is

From the Sachs theorem [13], we can easily get ${b}_{2i}(G)=m(G,i)-2m(G-{C}_{l},i-\frac{l}{2})$. By Lemma 4.1 we have ${a}_{2i}({G}^{-})=m(G,i)-2m(G-{C}_{l},i-\frac{l}{2})$, which implies that ${b}_{2i}(G)={a}_{2i}({G}^{-})$. Combining (2) and (15), we can find that $E(G)={E}_{s}({G}^{-})$. □

In [16], Li *et al.* showed the following result.

**Lemma 4.7** ([16])

- (1)
*Let*$G\in {B}_{1}(2k)$.*If*$G\ne {B}_{1}$,*then*$E({B}_{1})<E(G)$. - (2)
*Let*$G\in {B}_{2}(2k)$.*If*$G\ne {B}_{2}$,*then*$E({B}_{2})<E(G)$. - (3)
*Let*$G\in {B}_{3}(2k)$.*If*$G\ne {B}_{3}$,*then*$E({B}_{3})<E(G)$.

**Lemma 4.8** *Let* *G* *be a bipartite unicyclic graph*. *Then* ${E}_{s}({G}^{-})<{E}_{s}({G}^{+})$.

*Proof*Let ${C}_{l}$ be the unique cycle of

*G*. From Lemma 4.1, we can see that

which implies that ${a}_{2i}({G}^{-})\le {a}_{2i}({G}^{+})$. ${a}_{l}({G}^{-})<{a}_{l}({G}^{+})$ yields that ${E}_{s}({G}^{-})<{E}_{s}({G}^{+})$. □

Now we can use Lemmas 4.6, 4.7 and 4.8 to prove the result (R_{3}) as follows.

*Proof of (R*_{
3
}*)* We first prove the result (1) of (R_{3}). Let ${G}^{\sigma}\in {B}_{1}^{\sigma}(2k)$ and ${C}_{l}$ be the unique cycle of *G*. Then $l\equiv 0(mod4)$.

If ${C}_{l}$ is evenly oriented relative to *σ*, then ${E}_{s}({G}^{\sigma})={E}_{s}({G}^{-})$. From Lemmas 4.6 and 4.7 we have ${E}_{s}({B}_{1}^{-})=E({B}_{1})<E(G)={E}_{s}({G}^{-})={E}_{s}({G}^{\sigma})$. Then the result (1) holds.

If ${C}_{l}$ is oddly oriented relative to *σ*, then ${E}_{s}({G}^{\sigma})={E}_{s}({G}^{+})$. Using Lemmas 4.6, 4.7 and 4.8, we can see that ${E}_{s}({B}_{1}^{-})=E({B}_{1})\le E(G)={E}_{s}({G}^{-})<{E}_{s}({G}^{+})={E}_{s}({G}^{\sigma})$. Then the result (1) holds.

The results (2) and (3) of (R_{3}) can be proved similarly. Thus we have completed the proof. □

## Declarations

### Acknowledgements

The first author is very grateful to Professor Jia-Yu Shao for his help. This work is supported by the National Natural Science Foundation of China 11426149 and 71173145, and Shanghai Project 085.

## Authors’ Affiliations

## References

- Gutman I:
**The energy of a graph.***Ber. Math.-Stat. Sekt. Forschungszent. Graz*1978,**103:**1–22.Google Scholar - Gutman I:
**The energy of a graph: old and new results.**In*Algebraic Combinatorics and Applications*. Springer, Berlin; 2001:196–211.View ArticleGoogle Scholar - Li X, Shi Y, Gutman I:
*Graph Energy*. Springer, New York; 2012.View ArticleMATHGoogle Scholar - Shader B, So W:
**Skew spectra of oriented graphs.***Electron. J. Comb.*2009.,**16:**Article ID N32Google Scholar - Adiga C, Balakrishnan R, So W:
**The skew energy of a digraph.***Linear Algebra Appl.*2010,**432:**1825–1835. 10.1016/j.laa.2009.11.034MathSciNetView ArticleMATHGoogle Scholar - Gong, S, Li, X, Xu, G: On oriented graphs with minimal skew energy. arXiv:1304.2458v1 [math. CO]Google Scholar
- Hou Y, Lei T:
**Characteristic polynomial of skew-adjacency matrices of oriented graphs.***Electron. J. Comb.*2011.,**18:**Article ID P156Google Scholar - Hou, Y, Shen, X, Zhang, C: Oriented unicyclic graphs with extremal skew energy. arXiv:1108.6229v1 [math. CO]Google Scholar
- Li, X, Lian, H: A survey on the skew energy of oriented graphs. arXiv:1304.5707v4 [math. CO]Google Scholar
- Shen X, Hou Y, Zhang C:
**Bicyclic digraphs with extremal skew energy.***Electron. J. Linear Algebra*2012,**23:**340–355.MathSciNetMATHGoogle Scholar - Yang X, Gong S, Xu G:
**Minimal skew energy of oriented unicyclic graphs with fixed diameter.***J. Inequal. Appl.*2013.,**2013:**Article ID 418Google Scholar - Zhu J:
**Oriented unicyclic graphs with the first**$\lfloor \frac{n-9}{2}\rfloor $**largest skew energies.***Linear Algebra Appl.*2012,**437:**2630–2649. 10.1016/j.laa.2012.06.036MathSciNetView ArticleMATHGoogle Scholar - Cvetković D, Doob M, Sachs H:
*Spectra of Graphs: Theory and Application*. Academic Press, New York; 1980.Google Scholar - Shan H, Shao J:
**The proof of a conjecture on the comparison of the energies of trees.***J. Math. Chem.*2012,**50:**2637–2647. 10.1007/s10910-012-0052-4MathSciNetView ArticleMATHGoogle Scholar - Wang W, Chang A, Lu D:
**Unicyclic graphs possessing Kekulé structures with minimal energy.***J. Math. Chem.*2007,**42:**311–319. 10.1007/s10910-006-9096-7MathSciNetView ArticleMATHGoogle Scholar - Li X, Zhang J, Zhou B:
**On unicyclic conjugated molecules with minimal energies.***J. Math. Chem.*2007,**42:**729–740. 10.1007/s10910-006-9116-7MathSciNetView ArticleMATHGoogle Scholar

## Copyright

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly credited.