Research ArticleOpen AccessGoogle Scholar indexed
The Quasi-Order of Matching Energy of Circum Graph with Chord
School of Mathematics and Statistics, Qinghai Nationalities University, Xining, China
School of Mathematics and Statistics, Qinghai Nationalities University, Xining, China
- 1 School of Mathematics and Statistics, Qinghai Nationalities University, Xining, China
- 2 School of Mathematics and Statistics, Qinghai Nationalities University, Xining, China
Applied Mathematics·Volume 08 (2017)·Pages 1180–1185·Published 7 August 2017·DOI10.4236/am.2017.88088
Copy link · social · email
Abstract
The matching energy of graph G is defined as , where be the roots of matching polynomial of graph G. In order to compare the energies of a pair of graphs, Gutman and Wager further put forward the concept of quasi-order relation. In this paper, we determine the quasiorder relation on the matching energy for circum graph with one chord.
KeywordsMatching PolynomialMatching EnergyMatching Root
- Godsil, C.D. (1993) Algebraic Combinatorics. Chapman and Hall, Academic Press, New York.
- Farrell, E.J. (1979) An Introduction to Matching Polynomials. Journal of Combinatorial Theory, Series B, 27, 75-86. https://doi.org/10.1016/0095-8956(79)90070-4
- Gutman, I. and Wagner, S. (2012) The Matching Energy of a Graph. Discrete Applied Mathematics, 160, 2177-2187. https://doi.org/10.1016/j.dam.2012.06.001
- Chen, L. and Shi, Y. (2015) The Maximal Matching Energy of Tricyclic Graphs. MATCH Communications in Mathematical and in Computer Chemistry, 73, 105- 119.
- Chen, L., Liu, J. and Shi, Y. (2015) Matching Energy of Unicyclic and Bicyclic Graphs with a Given Diameter. Complexity, 21, 224-238. https://doi.org/10.1002/cplx.21599
- Chen, L., Liu, J. and Shi, Y. (2016) Bounds on the Matching Energy of Unicyclic Odd-Cycle Graphs. MATCH Communications in Mathematical and in Computer Chemistry, 75, 315-330.
- Chen, L., Li, X. and Lian, H. (2015) The Matching Energy of Random Graphs. Discrete Applied Mathematics, 193, 102-109. https://doi.org/10.1016/j.dam.2015.04.022
- Feng, L., Liu, W., Ili?, A. and Yu, G. (2013) The Degree Distance of Unicyclic Graphs with Given Matching Number. Graphs Comb., 29, 353-360. https://doi.org/10.1007/s00373-012-1143-5
- Ji, S., Li, X. and Shi, Y. (2013) Extremal Matching Energy of Bicyclic Graphs. MATCH Communications in Mathematical and in Computer Chemistry, 70, 697- 706.
- Li, H., Zhou, Y. and Su, L. (2014) Graphs with Extremal Matching Energies and Prescribed Parameters. MATCH Communications in Mathematical and in Computer Chemistry, 72, 239-248.
- Li, S. and Yan, W. (2014) The Matching Energy of Graphs with Given Parameters. Discrete Applied Mathematics, 162, 415-420. https://doi.org/10.1016/j.dam.2013.09.014
- Xu, K., Zheng, Z. and Das, K.C. (2015) Extremal t-Apex Trees with Respect to Matching Energy. Complexity, 21, 238-247.
- Xu, K., Das, K.C. and Zheng, Z. (2015) The Minimum Matching Energy of (n,m)-Graphs with a Given Matching Number. MATCH Communications in Mathematical and in Computer Chemistry, 73, 93-104.
- Yan, W.G. and Yeh, Y.N. (2009) On the Matching Polynomial of Subdivision Graphs. Discrete Applied Mathematics, 157, 195-200. https://doi.org/10.1016/j.dam.2008.05.005
- Gutman, I. (1979) The Matching Polynomial. MATCH Communications in Mathematical and in Computer Chemistry, 6, 75-91.