- Research
- Open access
- Published:
Minimal skew energy of oriented unicyclic graphs with a perfect matching
Journal of Inequalities and Applications volume 2014, Article number: 486 (2014)
Abstract
Let 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 becomes a directed graph. The skew energy of is defined as the sum of the absolute values of all eigenvalues of the skew-adjacency matrix of . Denote by the set of all oriented unicyclic graphs on 2k vertices with a perfect matching which contain no cycle of length l with . In this paper, we characterize the oriented graphs of with the minimal skew energy for .
MSC:05C50, 15A30.
1 Introduction
Let G be a simple undirected graph on n vertices and be its adjacency matrix. Let be the spectrum of . Then the energy of G, denoted by , is defined as (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 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 becomes an oriented graph or a directed graph. Then G is called the underlying graph of .
The skew-adjacency matrix of is a real skew symmetric matrix, where and if is an arc of , otherwise . The skew-spectrum of is defined as the spectrum of . Note that consists of only purely imaginary eigenvalues because 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 , proposed first by Adiga et al. [5] and denoted by , is defined as the sum of the absolute values of all eigenvalues of , that is, , where are all the eigenvalues of . Recently, the skew energy of oriented graphs has been studied in [5–12].
The characteristic polynomial of the skew-adjacency matrix of an oriented graph is also called the skew characteristic polynomial of , written as . Since is a real skew symmetric matrix, we have and for all (see [5]). Then we have
Using equation (1), the skew energy of an oriented graph of order n can be expressed by the following integral formula [8]:
Note that and equals the number of the edges of G. It follows that is a strictly monotonically increasing function of those numbers () 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 and be two oriented graphs of order n. If for all i with , then we write .
Furthermore, if and there exists at least one index j such that , then we write that . If for all i, we write . According to the integral formula (2), we have for two oriented graphs and 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 for any n-vertex oriented tree , and thus which implies that , where and 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 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 () 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 the set of all oriented unicyclic graphs on 2k vertices with a perfect matching which contain no cycle of length l with . We finally characterize the oriented graphs of with the minimal skew energy for 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 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 the set of all evenly linear subgraphs of G with 2i vertices. For an evenly linear subgraph , we denote by 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 be an oriented graph with the skew characteristic polynomial . Then
where is the number of evenly oriented cycles of L and is the number of even cycles of L, respectively.
For convenience, we write in what follows. From Lemma 2.1, we can get the recurrence relation of as follows.
Theorem 2.1 Let v be a vertex of . Then
where and denote the sets of all oddly oriented cycles and evenly oriented cycles of , 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 that is on no even cycle in . Then
The coalescence of two oriented graphs and with respect to vertex u in and vertex v in , denoted by (sometimes abbreviated as ), is the oriented graph obtained by identifying the vertices u and v. From Theorem 2.1, we can deduce the recurrence relation of as follows.
Theorem 2.2
Proof By using (4) we can get
Moreover, it is easily checked that
Applying (6) to (5), we find that
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.
Let . The tree of order will be called the k-sun (see Figure 1), which can be obtained by inserting a new vertex on each edge of the star .
The coalescence of two graphs G and H with respect to vertex u in G and vertex v in H, denoted by (sometimes abbreviated as ), 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 , which is called the k-sun attaching graphs at u, see Figure 1. For any orientations , , and , for the sake of simplicity, we always write and .
From Theorem 2.2, we can get the recurrence relations of and in what follows.
Lemma 3.1
Proof By Theorem 2.2 we have
From Corollary 2.1, we can show
Applying (10) to (9), we can obtain (7). Similarly, we can show (8). Then the results hold. □
In what follows, we write:
It is easily checked that .
Furthermore, we write
Under the above notations, we have the following properties for the functions and .
Lemma 3.2 Let be fixed. Then, for all , we have the following.
-
(1)
If , then .
-
(2)
If , then .
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 and be two skew characteristic polynomials of two oriented graphs and with the same order. Then
In the following, we assume that 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, , and be defined as above. Then, for ,
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 . A k-matching is a disjoint union of k edges in G. The number of k-matchings is denoted by . We agree that and ().
With regard to the coefficients of an oriented unicyclic graph, Hou et al. [8] got the following lemma.
Lemma 4.1 ([8])
Let and be the unique cycle of G. Then we have:
-
(1)
If l is odd, then .
-
(2)
If l is even and is oddly oriented, then .
-
(3)
If l is even and is evenly oriented, then .
From Lemma 4.1, we can see that the skew energy of is independent of the orientation σ when l is odd. Thus, for convenience, we write as when l is odd. Furthermore, when l is even and is oddly oriented relative to σ, we write as . When l is even and is evenly oriented relative to σ, we write as .
Denote by the set of all unicyclic graphs on 2k vertices with a perfect matching which contain no cycle of length l with . Let , , , be the unicyclic graphs as shown in Figure 2. The following theorem is the main result of this section.
Theorem 4.1 Let and . If , then .
In order to prove Theorem 4.1, we first outline the basic strategy of the proof. We classify the graphs in into the following classes. Let = { the length of the unique cycle of G is divisible by 4} and .
Denote by 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 . Then or .
By Lemma 4.2, we can classify the graphs in into two classes as follows:
Next, in order to further classify the graphs in into two classes, we introduce some notations in what follows.
Throughout this paper, we denote by a perfect matching of a graph G. Let , where is the set of isolated vertices in . We call the capped graph of G and G the original graph of .
Denote by the edge set of a graph G. Let . Then . Since a tree contains at most one perfect matching, we can see that are the same under two different perfect matchings of G. Thus we can classify the graphs in into the following two classes:
To conclude, it is easy to see that
and , , and .
For , our basic strategy of the proof of Theorem 4.1 is to prove the following results (R1)-(R3) later:
(R1)
-
(1)
.
-
(2)
.
-
(3)
.
(R2) Let . If , then .
(R3)
-
(1)
Let . If , then .
-
(2)
Let . If , then .
-
(3)
Let . If , then .
It is easy to see that we can prove Theorem 4.1 by combining the above results (R1)-(R3). We will prove the results (R1)-(R3) in Sections 4.1 to 4.3, respectively.
4.1 The proof of (R1)
By some simple calculations, we find that and , and , and are all quasi-order incomparable. We first prove the results (2) and (3) of (R1) by Theorem 3.1.
Lemma 4.3 If , then .
Proof Let and (see Figure 2). By some simple calculations, we have
It is easily checked that implying that . From Theorem 3.1, we can deduce that for ,
Then . □
Lemma 4.4 If , then .
Proof Let and (see Figure 2). By some simple calculations we have
which implies that . Then we have . By Theorem 3.1, we can find that for ,
When and , we can have by some simple calculations. Consequently, for . □
By computing, we find that we cannot show that by the above method. Thus we use an alternate method to prove the result.
Lemma 4.5 If , then .
Proof When , we can get by some direct calculations. Then in what follows we assume that . By Corollary 2.1 we have
Since the roots of and are purely imaginary, we can take , which implies that
where and .
Let be the roots of and be the roots of . Then
Thus we only need to prove that for . By some calculations we get
It follows that , and implying that
Moreover,
which implies that we only need to show
In fact, it is easily checked that for , 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 (R2)
Let . Firstly, we show a method of computing the matching number of G. It is easy to see that . Thus each i-matching Ω of G can be partitioned into two parts: , where and . Let be the number of ways to choose i independent edges in G such that just j edges are in . For example, and .
Thus we have
where .
Proof of (R 2 ) Let . By Lemma 4.1 we have . Furthermore, since is a star of order , we have . From Lemma 4.1 we can deduce that . Because , implying that . □
4.3 The proof of (R3)
We firstly quote and prove some lemmas which will be used in the proof of (R3).
Lemma 4.6 Let G be a unicyclic graph of order n and be the unique cycle of G. If , then .
Proof Since , G is a bipartite unicyclic graph. Then we can assume that the characteristic polynomial of G is
where . According to the famous Coulson integral formula for energy of a graph [2], we have
From the Sachs theorem [13], we can easily get . By Lemma 4.1 we have , which implies that . Combining (2) and (15), we can find that . □
In [16], Li et al. showed the following result.
Lemma 4.7 ([16])
-
(1)
Let . If , then .
-
(2)
Let . If , then .
-
(3)
Let . If , then .
Lemma 4.8 Let G be a bipartite unicyclic graph. Then .
Proof Let be the unique cycle of G. From Lemma 4.1, we can see that
which implies that . yields that . □
Now we can use Lemmas 4.6, 4.7 and 4.8 to prove the result (R3) as follows.
Proof of (R 3 ) We first prove the result (1) of (R3). Let and be the unique cycle of G. Then .
If is evenly oriented relative to σ, then . From Lemmas 4.6 and 4.7 we have . Then the result (1) holds.
If is oddly oriented relative to σ, then . Using Lemmas 4.6, 4.7 and 4.8, we can see that . Then the result (1) holds.
The results (2) and (3) of (R3) can be proved similarly. Thus we have completed the proof. □
References
Gutman I: The energy of a graph. Ber. Math.-Stat. Sekt. Forschungszent. Graz 1978, 103: 1–22.
Gutman I: The energy of a graph: old and new results. In Algebraic Combinatorics and Applications. Springer, Berlin; 2001:196–211.
Li X, Shi Y, Gutman I: Graph Energy. Springer, New York; 2012.
Shader B, So W: Skew spectra of oriented graphs. Electron. J. Comb. 2009., 16: Article ID N32
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.034
Gong, S, Li, X, Xu, G: On oriented graphs with minimal skew energy. arXiv:1304.2458v1 [math. CO]
Hou Y, Lei T: Characteristic polynomial of skew-adjacency matrices of oriented graphs. Electron. J. Comb. 2011., 18: Article ID P156
Hou, Y, Shen, X, Zhang, C: Oriented unicyclic graphs with extremal skew energy. arXiv:1108.6229v1 [math. CO]
Li, X, Lian, H: A survey on the skew energy of oriented graphs. arXiv:1304.5707v4 [math. CO]
Shen X, Hou Y, Zhang C: Bicyclic digraphs with extremal skew energy. Electron. J. Linear Algebra 2012, 23: 340–355.
Yang X, Gong S, Xu G: Minimal skew energy of oriented unicyclic graphs with fixed diameter. J. Inequal. Appl. 2013., 2013: Article ID 418
Zhu J:Oriented unicyclic graphs with the first largest skew energies. Linear Algebra Appl. 2012, 437: 2630–2649. 10.1016/j.laa.2012.06.036
Cvetković D, Doob M, Sachs H: Spectra of Graphs: Theory and Application. Academic Press, New York; 1980.
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-4
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-7
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-7
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.
Author information
Authors and Affiliations
Corresponding author
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors’ contributions
JZ wrote and reformed the article. All authors read and approved the final manuscript.
Authors’ original submitted files for images
Below are the links to the authors’ original submitted files for images.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (https://creativecommons.org/licenses/by/4.0), which permits use, duplication, adaptation, distribution, and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Zhu, Jm., Yang, J. Minimal skew energy of oriented unicyclic graphs with a perfect matching. J Inequal Appl 2014, 486 (2014). https://doi.org/10.1186/1029-242X-2014-486
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/1029-242X-2014-486