- Publications
- Influence

Claim Your Author Page

Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage publications.

- Suhail K Ayesh, Yehong Shao, Wilfred Donald Stein
- Biochimica et biophysica acta
- 1996

We measured the effects of individual modulators and of pairs of modulators of the multidrug resistance pump, P-glycoprotein, on the accumulation of labelled daunomycin into multidrug-resistant P388… (More)

- Yehong Shao, Suhail K Ayesh, Wilfred Donald Stein
- Biochimica et biophysica acta
- 1997

We measured the effects of combinations of verapamil, vinblastine, mefloquine, and tamoxifen, all being modulators of the multidrug resistance pump, P-glycoprotein, on the accumulation of labelled… (More)

- Paul A. Catlin, Hong-Jian Lai, Yehong Shao
- Discrete Mathematics
- 2009

Given a graph G, for an integer [email protected]?{2,...,|V(G)|}, define @l"c(G)=min{|X|:[email protected]?E(G),@w(G-X)>=c}. For a graph G and for an integer c=1,2,...,|V(G)|-1, define, @t"c(G)[email… (More)

- Hong-Jian Lai, Yehong Shao, Gexin Yu, Mingquan Zhan
- Discrete Applied Mathematics
- 2009

We investigate graphs G such that the line graph L(G) is hamiltonian connected if and only if L(G) is 3-connected, and prove that if each 3-edge-cut contains an edge lying in a short cycle of G, then… (More)

- Hong-Jian Lai, Yehong Shao, Mingquan Zhan
- J. Comb. Theory, Ser. B
- 2006

Kuipers and Veldman conjectured that any 3-connected claw-free graph with order v and minimum degree δ ≥ (v+6)/10 is Hamiltonian for v sufficiently large. In this paper, we prove that if H is a… (More)

- Hong-Jian Lai, Yehong Shao, Mingquan Zhan
- Discrete Mathematics
- 2008

Let G be a graph. For u,v@?V(G) with dist"G(u,v)=2, denote J"G(u,v)={w@?N"G(u)@?N"G(v)|N"G(w)@?N"G(u)@?N"G(v)@?{u,v}}. A graph G is called quasi claw-free if J"G(u,v) @A for any u,v@?V(G) with… (More)

- Suohai Fan, Hong-Jian Lai, Yehong Shao, Taoye Zhang, Ju Zhou
- Discrete Mathematics
- 2008

A sequence d=(d"1,d"2,...,d"n) is graphic if there is a simple graph G with degree sequence d, and such a graph G is called a realization of d. A graphic sequence d is line-hamiltonian if d has a… (More)

- Lili Zhang, Yehong Shao, Guihai Chen, Xinping Xu, Ju Zhou
- Graphs and Combinatorics
- 2012

AbstractA graph G is vertex pancyclic if for each vertex $${v \in V(G)}$$ , and for each integer k with 3 ≤ k ≤ |V(G)|, G has a k-cycle Ck such that $${v \in V(C_k)}$$ . Let s ≥ 0 be an integer. If… (More)

A graph G is triangularly connected if for every pair of edges e1, e2 ∈ E(G), G has a sequence of 3-cycles C1, C2, · · · , Cl such that e1 ∈ C1, e2 ∈ Cl and such that E(Ci) ∩ E(Ci+1) 6= ∅, (1 ≤ i ≤ l… (More)

- Hong-Jian Lai, Manoel Lemos, Talmage James Reid, Yehong Shao, Haidong Wu
- Eur. J. Comb.
- 2011

Bixby and Cunningham showed that a 3-connected binary matroid M is graphic if and only if every element belongs to at most two non-separating cocircuits. Likewise, Lemos showed that such a matroid M… (More)