- Open Access
Minimal skew energy of oriented unicyclic graphs with fixed diameter
© Yang et al.; licensee Springer. 2013
- Received: 1 May 2013
- Accepted: 16 August 2013
- Published: 2 September 2013
Let be the skew adjacency matrix of the oriented graph , which is obtained from a simple undirected graph G by assigning an orientation σ to each of its edges. The skew energy of an oriented graph is defined as the sum of all singular values of . For any positive integer d with , we in this paper, determine the graph with minimal skew energy among all oriented unicyclic graphs on n vertices with fixed diameter d.
- oriented graph
- unicyclic graph
- skew energy
Research on the energy of a matrix in terms of a related graph can be traced back to 1970s  when Gutman investigated the energy with respect to the adjacency matrix of an (undirected) graph, which has a still older chemical origin; see . Then much attention has been devoted to the energy of the adjacency matrix of a graph; see [1, 3–8], and the references cited therein. Recently, in analogy to the energy of the adjacency matrix, a few other versions of graph energy were introduced in the mathematical literature, such as Laplacian energy , signless Laplacian energy  and skew energy .
Then is a skew-symmetric matrix, and thus the eigenvalues of are all purely imaginary numbers.
where are all eigenvalues of the skew adjacency matrix . Adiga et al.  showed that the skew energy of an oriented tree is independent of its orientation, which is equal to the energy of its underlying tree. Moreover, Adiga et al.  investigated the skew energies of oriented cycles by computing. Then Hou et al.  determined the oriented unicyclic graphs with minimal and maximal skew energy, respectively; Gong et al. determined all oriented graphs with minimal skew energy among all connected oriented graphs on n vertices with m () edges , and all 3-regular connected oriented graphs with optimal skew energies .
In this paper, we continue to investigate the skew energy of oriented unicyclic graphs. Below, we focus on the graphs with order at least 5, since the skew energy of an oriented graph with a small order can be calculated directly by mathematical software such as Matlab 7.0. As we know that for any oriented unicyclic graph with order n (). If , then, up to isomorphism, must be the graph obtained from the oriented star by adding one arc between arbitrary two pendent vertices of it. Therefore, we in the following always assume that .
The rest of this paper is organized as follows: In Section 2, we give some notation and preliminary results, which will be used in the following discussion. The graph with minimal skew energy among all oriented unicyclic graphs on n (≥6) vertices with diameter d () will be determined in Section 3.
Let be a simple graph. Denote by the graph obtained from G by deleting the edge e and by the graph obtained from G by deleting the vertex v together with all edges incident to it and by the diameter of G, which is defined as the greatest distance between any two vertices in G. The union of the graphs and , denoted by , is the graph with vertex-set and edge-set . An r-matching of G is a subset with r edges such that every vertex of is incident with at most one edge in it. Denote by the number of r-matchings contained in G. We refer to Cvetković et al.  for more terminology and notation not defined here.
For convenience, in terms of defining subgraph, matchings, degree, diameter, etc., of an oriented graph, we focus only on its underlying graph. Moreover, we will briefly use the notations , and to denote the oriented cycle, the oriented star and the oriented path on n vertices, respectively, if no conflict exists there.
An even cycle C is called oddly oriented if for either choice of direction of traversing around C, the number of edges of C directed in the direction of traversal is odd. Since C is even, this is clearly independent of the initial choice of direction of traversal. Otherwise, such an even cycle C is called evenly oriented. (We here do not involve the parity of the cycle with length odd, the reason is it dependents on the initial choice of direction of traversal.)
An oriented graph H is called a ‘basic oriented graph’ if each component of H is or a cycle with length is even.
where denotes the identity matrix of order n.
The following result is a cornerstone of our discussion below, which gives an interpretation of all coefficients of the skew characteristic polynomial of an oriented graph in terms of its basic oriented subgraphs.
where the summation is over all basic oriented graphs ℋ, of , having i vertices, and and are respectively the number of evenly oriented even cycles and even cycles contained in ℋ.
As an analogy to the Coulson integral formula for the energy of an undirected graph with respect to its adjacency matrix, Hou et al.  deduce an integral formula for the skew energy of an oriented graph in terms of the coefficients of its skew characteristic polynomial.
Lemma 2.2 [, Theorem 2.6]
and denotes the coefficient of in .
From Lemma 2.2, for an oriented graph , the skew energy is a strictly monotonically increasing function of the coefficients (). Thus, similar to comparing the energies of two undirected graphs with respect to their adjacency matrices, we define the quasi-ordering relation ‘⪯’ for oriented graphs as follows.
Let and be two oriented graphs of order n. ( is not necessary different from .) If for all i with , then we write that .
Furthermore, if and there exists at least one index i such that , then we write that . If for all i, we write that . Note that there are non-isomorphic oriented graphs and with , which implies that ‘⪯’ is not a partial order in general.
Proposition 2.1 also implies that to study the spectral properties, as well as the skew energy, of an oriented graph, we need only consider the orientations of those arcs lying on even cycles. Let G be a connected unicyclic graph whose unique cycle is even. Denote by and the oriented graph with underlying graph G and the unique oriented cycle is evenly oriented and oddly oriented, respectively. Combining with Proposition 2.1 and Lemma 2.2, we have the following.
Then and . Thus, the result holds. □
For convenience, denote by the set of all oriented unicyclic graphs on n vertices with diameter d and by the set of all undirected or oriented trees on n vertices with diameter d. From Theorem 2.3, we can narrow down the possibility of the graph with minimum skew energy among all oriented unicyclic graphs as follows.
Lemma 2.4 Let be an oriented graph with minimum skew energy among all graphs of . Denote by C the unique oriented cycle of . Then C is either an odd cycle or an evenly oriented even cycle.
Moreover, the following recursions concerning skew characteristic polynomials of oriented graphs are needed.
if C is oddly oriented and ;
if C is evenly oriented and ;
Proof (a) We divide all basic subgraphs of having i vertices into three parts: those that do not contain the arc e; those that contain e as the elementary subgraph , and those that contain the evenly oriented cycle C. Then the former is the coefficient of in , the second part can be considered as the coefficient of in and the latter can be considered as the coefficient of in multiplied by 2. Hence, the equality holds.
Similarly, (b) and (c) can be proved. □
Combining with Lemma 2.5(c) and (2), we have
Lemma 2.6 Let be an oriented graph containing no even cycles and a spanning subgraph (resp. proper spanning subgraph) of . Then (resp. ).
Let v be an arbitrary vertex of the oriented graph . The operation by reversing the orientations of all arcs incident with v and preserving the orientations of all its other arcs is called a reversal of at v, the resultant graph is denoted by . Let and be the skew adjacency matrices of the oriented graphs and , respectively. One can find that is similar to , thus has the same skew energy as that of . Especially, Adiga et al.  showed that the skew energy of a directed tree is independent of its orientation, which is equal to the energy of its underlying tree. Hence, the following results for undirected trees apply equally well to oriented trees, which will be cited in the following discussion directly.
Lemma 3.1 
Lemma 3.2 
Lemma 3.3 
Lemma 3.4 
Denote by the set of oriented graphs with underlying graph and the unique oriented cycle is evenly oriented. Because all skew adjacency matrices of are similar by the method reversal above, and thus each of them has the same skew energy, we in the following do not concern the orientation of each graph of . To obtain the main result of this paper, we first establish the following two lemmas.
Proof By Lemma 2.4, it suffices to consider those oriented graphs whose unique cycle is either odd or evenly oriented.
Combining with the induction hypothesis, and with equality if and only if and , respectively. The proof is complete. □
Proof Similarly to Lemma 3.5, it suffices to consider those oriented graphs whose unique cycle is either odd or evenly oriented. Let . We prove the lemma by induction on p. By Lemma 3.5, the result follows for . Suppose now that and the result holds for .
Let (, ) and . To show , we divide into the following three cases.
Case 1. contains no pendent vertices.
By Lemma 3.2, and . By Lemma 3.1, . Then combining with (3), (5) and (6), .
Case 2. All pendent vertices are contained in the longest path of .
Subcase 2.1. r is odd.
Subcase 2.2. r is even and .
From Lemma 2.6, we have and . Consequently, combining with (4), .
Subcase 2.3. .
Case 3. There exist pendent vertices not contained in the longest path of .
Subcase 3.1. There exists a pendent vertex such that its neighbor is not contained in .
Say u is such a pendent vertex. Then , and thus by the induction hypothesis; by Lemmas 3.3 and 2.6. Consequently, .
Subcase 3.2. The neighbor of each pendent vertex is contained in , and there exist no pendent vertices whose neighbor lies on .
Thus, . Consequently, by (11).
Subcase 3.3. The neighbor of each pendent vertex is contained in , and there exist pendent vertices whose neighbor lies on .
Thus the result follows. □
Putting Lemma 3.5 together with Lemma 3.6, the main result of this paper can be obtained.
Theorem 3.7 Let and . Then the oriented graph with minimum skew energy among all graphs of is of .
Proof Let and . Then with equality if and only if for any oriented unicyclic graph by Lemma 3.5 and Lemma 3.6. Then with equality if and only if by (2), and thus the result follows. □
This work was supported by the National Natural Science Foundation of China (11171373) and the Zhejiang Provincial Natural Science Foundation of China (LY12A01016).
- Gutman I: The energy of a graph. Ber. Math.-Stat. Sekt. Forsch. Graz 1978, 103: 1–22.Google Scholar
- Coulson CA: On the calculation of the energy in unsaturated hydrocarbon molecules. Proc. Camb. Philos. Soc. 1940, 36: 201–203. 10.1017/S0305004100017175View ArticleGoogle Scholar
- Akbari S, Ghorbani E, Oboudi MR: Edge addition, singular values and energy of graphs and matrices. Linear Algebra Appl. 2009, 430: 2192–2199. 10.1016/j.laa.2008.11.027MathSciNetView ArticleGoogle Scholar
- Blackburn SR, Shparlinski IE: On the average energy of circulant graphs. Linear Algebra Appl. 2008, 428: 1956–1963. 10.1016/j.laa.2007.11.003MathSciNetView ArticleGoogle Scholar
- Gutman I: The energy of a graph: old and new results. In Algebraic Combinatorics and Applications. Edited by: Better A, Kohnert A, Lau R, Wassermann A. Springer, Berlin; 2001:196–211.View ArticleGoogle Scholar
- Indulal G, Vijayakumar A: A note on energy of some graphs. MATCH Commun. Math. Comput. Chem. 2008, 59: 269–274.MathSciNetGoogle Scholar
- Majstorović S, Klobučar A, Gutman I: Selected topics from the theory of graph energy: hypoenergetic graphs. In Applications of Graph Spectra. Edited by: Cvetković D, Gutman I. Math. Inst., Belgrade; 2009:65–105.Google Scholar
- Nikiforov V: The energy of graphs and matrices. J. Math. Anal. Appl. 2007, 326: 1472–1475. 10.1016/j.jmaa.2006.03.072MathSciNetView ArticleGoogle Scholar
- Gutman I, Zhou B: Laplacian energy of a graph. Linear Algebra Appl. 2006, 414: 29–37. 10.1016/j.laa.2005.09.008MathSciNetView ArticleGoogle Scholar
- Gutman I, Robbiano M, Martins EA, Cardoso DM, Medina L, Rojo O: Energy of line graphs. Linear Algebra Appl. 2010, 433: 1312–1323. 10.1016/j.laa.2010.05.009MathSciNetView ArticleGoogle 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 ArticleGoogle Scholar
- Hou, YP, Shen, XL, Zhang, CY: Oriented unicyclic graphs with extremal skew energy. arXiv:1108.6229. e-printatarXiv.org
- Gong, SC, Li, XL, Xu, GH: On oriented graphs with minimal skew energy. arXiv:1304.2458. e-printatarXiv.org
- Gong SC, Li XL, Xu GH: 3-Regular oriented graphs with optimum skew energy. Linear Algebra Appl. 2012, 436: 465–471. 10.1016/j.laa.2011.03.067MathSciNetView ArticleGoogle Scholar
- Cvetković D, Doob M, Sachs H: Spectra of Graphs. Academic Press, New York; 1980.Google Scholar
- Gong SC, Xu GH: The characteristic polynomial and the matchings polynomial of a weighted oriented graph. Linear Algebra Appl. 2012, 436: 3597–3607. 10.1016/j.laa.2011.12.033MathSciNetView ArticleGoogle Scholar
- Hou Y, Lei T: Characteristic polynomials of skew-adjacency matrices of oriented graphs. Electron. J. Comb. 2011., 18: Article ID 156Google Scholar
- Zhou B, Li F: On minimal energies of trees of a prescribed diameter. J. Math. Chem. 2006, 39: 465–473. 10.1007/s10910-005-9047-8MathSciNetView ArticleGoogle Scholar
- Gutman I: Acyclic systems with extremal Hückel-electron energy. Theor. Chim. Acta 1977, 45: 79–87. 10.1007/BF00552542View ArticleGoogle Scholar
- Yan W, Ye L: On the minimal energy of trees with a given diameter. Appl. Math. Lett. 2005, 18: 1046–1052. 10.1016/j.aml.2004.11.001MathSciNetView ArticleGoogle Scholar
- Li F, Zhou B: Minimal energy of unicyclic graphs of a given diameter. J. Math. Chem. 2006, 39: 465–473. 10.1007/s10910-005-9047-8MathSciNetView ArticleGoogle Scholar
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/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.