Jinfeng Feng

Learn More
LetG= (V ,E) be a 2-connected simple graph and let dG(u, v) denote the distance between two vertices u, v in G. In this paper, it is proved: if the inequality dG(u) + dG(v) |V (G)| − 1 holds for each pair of vertices u and v with dG(u, v) = 2, then G is Hamiltonian, unless G belongs to an exceptional class of graphs. The latter class is described in this(More)
An edge-colored graph H is properly colored if no two adjacent edges of H have the same color. In 1997, J. Bang-Jensen and G. Gutin conjectured that an edgecolored complete graph G has a properly colored Hamilton path if and only if G has a spanning subgraph consisting of a properly colored path C0 and a (possibly empty) collection of properly colored(More)
The efficient gene transfection, cellular uptake and targeted delivery in vivo are key issues for non-viral gene delivery vectors in cancer therapy. To solve these issues, we designed a new targeted gene delivery system based on epidermal growth factor receptor (EGFR) targeting strategy. An anti-EGFR monoclonal antibody h-R3 was introduced to dendriplexes(More)
An arc going out from a vertex x in a digraph is called an out-arc of x.Yao et al. [DiscreteAppl. Math. 99 (2000) 245–249] proved that every strong tournament contains a vertex x such that all out-arcs of x are pancyclic. Recently,Yeo [J. Graph Theory 50 (2005) 212–219] proved that each 3-strong tournament contains two such vertices. In this paper, we(More)
In this study, a CMOS compatible capacitive humidity sensor structure was designed and fabricated on a 200 mm CMOS BEOL Line. A top Al interconnect layer was used as an electrode with a comb/serpent structure, and graphene oxide (GO) was used as sensing material. XRD analysis was done which shows that GO sensing material has a strong and sharp (002) peak at(More)