@article{145ccdbc90264aaba05f6d8ddf98f85a, title = "On the integral weighted oriented unicyclic graphs with minimum skew energy", abstract = "Let Gσ be a weighted oriented graph, which is obtained from a simple weighted undirected graph by assigning an orientation to each of its edges. For a (weighted) oriented graph Gσ, the undirected graph obtained from Gσ by removing the orientation and the weight of each of its arcs is called the underlying graph of G σ, denoted by Ĝ. By U(n,m)(m≥n) we denote the set of all connected integral weighted oriented unicyclic graphs with order n in which each arc is assigned a positive integral weight and the sum of the weights of all arcs is equal to the specified integer m. In this paper, we investigate the minimal skew energies of integral weighted unicyclic oriented graphs, showing that the underlying graph of the oriented graph with minimum skew energy among all graphs over U(n,m)(n≥6) is Sn,3, the graph obtained from a triangle by attaching n-3 pendent edges in exactly one of its vertices. Moreover, we show that its weight sequence has form(w1,a, a,.,a{\"i}̧·k,a+ 1,a+1,.,a+1{\"i}̧·n-3-k,w2,w3)in which the arc lying on the cycle C3 and incident to no pendent arcs has weight w1, and the two largest weights correspond the other two arcs of C3, where positive integer numbers w1,w 2,w3,a and k satisfy 1≤w1≤a,a+1≤w 2≤w3≤a+w1 and m=w1+ka+(n-k-3) (a+1)+w2+w3. In addition, we determine the weight sequence above for n≤m≤3n-1.", keywords = "Integral weighted graph, Oriented graph, Skew energy, Skew symmetric matrix", author = "Shi-Cai Gong and Yao-Ping Hou and Ching-Wah Woo and Guang-Hui Xu and Xiao-Ling Shen", year = "2013", month = jun, day = "1", doi = "10.1016/j.laa.2013.02.018", language = "English", volume = "439", pages = "262--272", journal = "Linear Algebra and Its Applications", issn = "0024-3795", publisher = "Elsevier Inc.", number = "1", }