output
19952026
most citedRes2Net: A New Multi-scale Backbone Architecture

3.5k citations

Showing 2014 · math.COShow all

20 papers · 2 filters

math.CO2014

Colorful monochromatic connectivity of random graphs

Ran Gu, Xueliang Li, Zhongmei Qin

An edge-coloring of a connected graph is called a {\it monochromatic connection coloring} (MC-coloring, for short), introduced by Caro and Yuster, if there is a monochromatic p…

math.CO2014★ 1 cited

The matching energy of random graphs

Xiaolin Chen, Xueliang Li, Huishu Lian

The matching energy of a graph was introduced by Gutman and Wagner, which is defined as the sum of the absolute values of the roots of the matching polynomial of the graph. For the…

math.CO2014★ 1 cited

-Regular mixed graphs with optimum Hermitian energy

Xiaolin Chen, Xueliang Li, Yingying Zhang

Let be a simple undirected graph, and be a mixed graph of with the generalized orientation and Hermitian-adjacency matrix . Then is called the underly…

math.CO2014

The Method of Multiple Combinatorial Telescoping

Daniel K. Du, Qing-Hu Hou, Charles B. Mei

We generalize the method of combinatorial telescoping to the case of multiple summations. We shall demonstrate this idea by giving combinatorial proofs for two identities of Andrew…

math.CO2014

On graphs with maximum Harary spectral radius

Fei Huang, Xueliang Li, Shujing Wang

Let be a simple graph with vertex set . The Harary matrix of , which is initially called the reciprocal distance matrix, is an $n \…

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…