Search

Your search keyword '"Dong, Fengming"' showing total 119 results
Start Over Author "Dong, Fengming"
119 results on '"Dong, Fengming"'

102. Graph Theory

Author

Koh, Khee Meng, primary, Dong, Fengming, additional, Ng, Kah Loon, additional, and Tay, Eng Guan, additional

Published
2015
Full Text
View/download PDF

104. Vertex–colourings of Graphs

Author

Tay Eng Guan, Dong Fengming, and Koh Khee Meng

Subjects
Vertex (graph theory), Combinatorics, Mathematics
Published
2007

107. Eulerian Multigraphs and Hamiltonian Graphs

Author

Dong Fengming, Koh Khee Meng, and Tay Eng Guan

Subjects
symbols.namesake, symbols, Eulerian path, Hamiltonian graphs, Mathematical physics, Hamiltonian path problem, Mathematics
Published
2007

108. Matchings in Bipartite Graphs

Author

Koh Khee Meng, Tay Eng Guan, and Dong Fengming

Subjects
Combinatorics, Indifference graph, Bipartite graph, Strong perfect graph theorem, Complete bipartite graph, Blossom algorithm, Tutte theorem, Mathematics
Published
2007

109. Graph Isomorphisms, Subgraphs, the Complement of a Graph

Author

Koh Khee Meng, Dong Fengming, and Tay Eng Guan

Subjects
Discrete mathematics, Combinatorics, law, Computer science, Line graph, Petersen graph, Voltage graph, Perfect graph theorem, Null graph, Graph property, Complement graph, Simplex graph, law.invention
Published
2007

110. Bipartite Graphs and Trees

Author

Dong Fengming, Koh Khee Meng, and Tay Eng Guan

Subjects
Combinatorics, Dense graph, Pathwidth, Matching (graph theory), Bipartite graph, Strong perfect graph theorem, Robertson–Seymour theorem, Complete bipartite graph, 1-planar graph, Mathematics
Published
2007

117. The chromatic equivalence class of [formula omitted].

Author

Ng, Boon Leong and Dong, Fengming

Subjects
*GRAPH coloring, *EQUIVALENCE classes (Set theory), *MATHEMATICAL formulas, *SET theory, *GRAPH theory
Abstract

The chromatic equivalence class of a graph G is the set of graphs that have the same chromatic polynomial as G . We find the chromatic equivalence class of the complete tripartite graphs K 1 , n , n + 2 for all n ≥ 2 . This partially answers a question raised in Chia and Ho (2009), which asks for the chromatic equivalence class of the graph K 1 , m , n where 2 ≤ m ≤ n . [ABSTRACT FROM AUTHOR]

Published
2015
Full Text
View/download PDF

119. [Theanine, EGCG and caffeine determinated by HPLC].

Author

Diao F, Dong F, Wang Q, Liu N, Guo D, and Cui X

Subjects
Catechin analysis, Chromatography, High Pressure Liquid, Sensitivity and Specificity, Caffeine analysis, Catechin analogs & derivatives, Glutamates analysis, Tea chemistry
Abstract

Objective: A high-performance liquid chromatography (HPLC) method was developed for the determination of theanine in puer tea without derivatization and HPLC for EGCG and caffeine with ingredient elution system was put forward., Methods: The theanine in the tea was extracted with water. The EGCG and caffeine was extracted with water: ethanol (3:7) by ultrasonic oscillation. After centrifugation, the extract was analyzed by HPLC-PDAD with a C18column and at the flow rate 1 ml/min. The theanine was determinated with 5 mmol/L SDS-acetonitrile mobile phase system (72:28), and both EGCG and caffeine with 0.05 mmol/L KH2PO4-methonal mobile phase system (80:20)., Results: The calibration of three ingredients was in good linearity. The recovery range is 85%-110%. The RSD is less than 10%., Conclusion: The method is accurate and stable.

Published
2010

Catalog

Books, media, physical & digital resources
See catalog results