2 papers
math.CO2016
On various (strong) rainbow connection numbers of graphs
Lin Chen, Xueliang Li, Henry Liu +1
An edge-coloured path is \emph{rainbow} if all the edges have distinct colours. For a connected graph , the \emph{rainbow connection number} is the minimum number of col…
math.CO2014
Matching Energy of Unicyclic and Bicyclic Graphs with a Given Diameter
Lin Chen, Jinfeng Liu, Yongtang Shi
Gutman and Wagner proposed the concept of matching energy (ME) and pointed out that the chemical applications of ME go back to the 1970s. Let be a simple graph of order and…