Jinfeng Feng

Learn 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 edge-colored complete graph G has a properly colored Hamilton path if and only if G has a spanning subgraph consisting of a properly colored path C 0 and a (possibly empty) collection of properly colored(More)
Let G = (V , E) be a 2-connected simple graph and let d G (u, v) denote the distance between two vertices u, v in G. In this paper, it is proved: if the inequality d G (u) + d G (v) |V (G)| − 1 holds for each pair of vertices u and v with d G (u, v) = 2, then G is Hamiltonian, unless G belongs to an exceptional class of graphs. The latter class is described(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)
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)
Let G = (V, E) be a connected graph. The distance between two vertices x and y in G, denoted by d G (x, y), is the length of a shortest path between x and y. A graph G is called almost distance-hereditary, if each connected induced subgraph H of G has the property that d H (u, v) ≤ d G (u, v) + 1 for every pair of vertices u and v in H. We will confirm that(More)