#### Filter Results:

- Full text PDF available (11)

#### Publication Year

2007

2017

- This year (6)
- Last 5 years (26)
- Last 10 years (60)

#### Publication Type

#### Co-author

#### Publication Venue

#### Data Set Used

#### Key Phrases

Learn More

- Lihua Feng
- 2010

In this paper, we study the signless Laplacian spectral radius of bicyclic graphs with given number of pendant vertices and characterize the extremal graphs.

- Sheng Zhang, Lihua Feng, Hao Jiang, Wujun Ma, Helena Korpelainen, Chunyang Li
- Journal of proteome research
- 2012

Male and female poplars (Populus cathayana Rehd.) respond differently to environmental stresses. However, little is known about sex-dependent responses to chilling at the proteome level. To better understand these differences, a comparative proteomics investigation combined with a biochemical approach was used in the current study. Three-month-old poplar… (More)

- Aleksandar Ilic, Dragan Stevanovic, Lihua Feng, Guihai Yu, Peter Dankelmann
- Discrete Applied Mathematics
- 2011

- Lihua Feng, Guihai Yu, Kexiang Xu, Zhengtao Jiang
- Ars Comb.
- 2014

- Guihai Yu, Lihua Feng
- 2012

The connective eccentricity index of a graph G is defined as ξ ce (G) = v∈V (G) d(v) ε(v) , where ε(v) and d(v) denote the eccentricity and the degree of the vertex v, respectively. In this paper we derive upper or lower bounds for the connective eccentricity index in terms of some graph invariants such as the radius, independence number, vertex… (More)

- Lihua Feng, Qiao Li, Xiao-Dong Zhang
- Appl. Math. Lett.
- 2007

We consider the set G n,k of graphs of order n with the chromatic number k ≥ 2. In this note, we prove that in G n,k the Turán graph T n,k has the maximal spectral radius; and P n if k = 2, C n if k = 3 and n is odd, C 1 n−1 if k = 3 and n is even, K (l) k if k ≥ 4 has the minimal spectral radius. Thus we answer a problem raised by Cao [D.

- LIHUA FENG, GUIHAI YU, WEIJUN LIU
- 2014

Let G be a connected graph with vertex set V .G/. is the degree of vertex u, and R.u; v/ denotes the resistance distance between vertices u and v. In this paper we obtain some upper and lower bounds for the degree Kirchhoff index of graphs. We also obtain some bounds for the Nordhaus-Gaddum-type result for the degree Kirchhoff index.

- Guihai Yu, Lihua Feng, Aleksandar Ilic
- Ars Comb.
- 2010

- Lihua Feng, Aleksandar Ilic
- Appl. Math. Lett.
- 2010

- Lihua Feng, Weihu Hong
- Neural Computing and Applications
- 2009