Extremal Matching Energy of Bicyclic Graphs

By Shengjin Ji, Xueliang Li, Yongtang Shi. 2013

72 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/b059db7ec8d5f13b7ddfa2d5a56b6fcc34f7f5af

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Lin Chen
2. Yongtang Shi

Citations in the corpus

• The Maximal Matching Energy of Tricyclic Graphs (2014, background): “rs gave some elementary results on the matching energy and obtained that ME(S+ n ) ≤ ME(G) ≤ ME(Cn) for any unicyclic graph G, where S+ n is the graph obtained by adding a new edge to the star Sn. In [20], Ji et al. proved that for G ∈ Bn with n ≥ 10 and n = 8, ME(S∗ n) ≤ ME(G) ≤ ME(P4,n−4 n ). In [”