52 citations · 100 across the 32 of their papers we have counts for
8 papers · 1 filter
On heavy paths in 2-connected weighted graphs
Binlong Li, Shenggui Zhang
A weighted graph is a graph in which every edge is assigned a non-negative real number. In a weighted graph, the weight of a path is the sum of the weights of its edges, and the we…
Long paths and cycles passing through specified vertices under the average degree condition
Binlong Li, Bo Ning, Shenggui Zhang
Let be a -connected graph with . In this paper we first prove that: For two distinct vertices and in , it contains a path passing through its any {…
Heavy subgraph conditions for longest cycles to be heavy in graphs
Binlong Li, Shenggui Zhang
Let be a graph on vertices. A vertex of with degree at least is called a heavy vertex, and a cycle of which contains all the heavy vertices of is called a…
Extreme tenacity of graphs with given order and size
T. C. E. Cheng, Yinkui Li, Chuandong Xu +1
Computer or communication networks are so designed that they do not easily get disrupted under external attack and, moreover, these are easily reconstructible if they do get disrup…
Bipartite graphs with the maximum sum of squares of degrees
Shenggui Zhang, Chuncao Zhou
In this paper we determine all the bipartite graphs with the maximum sum of squares of degrees among the ones with a given number of vertices and edges.
Pairs of heavy subgraphs for Hamiltonicity of 2-connected graphs
Binlong Li, Zdeněk Ryjáček, Ying Wang +1
Let be a graph on vertices. An induced subgraph of is called heavy if there exist two nonadjacent vertices in with degree sum at least in . We say that $…