Подписаться
Fengming Dong
Fengming Dong
Professor, National Institute of Education, Nanyang Technological University, Singapore
Подтвержден адрес электронной почты в домене nie.edu.sg - Главная страница
Название
Процитировано
Процитировано
Год
Chromatic polynomials and chromaticity of graphs
FM Dong, KM Koh, KL Teo
World Scientific, 2005
3932005
On atom–bond connectivity index of connected graphs
RD Xing, B Zhou, FM Dong
Discrete Applied Mathematics 159 (15), 1617-1630, 2011
1282011
The vertex-cover polynomial of a graph
FM Dong, MD Hendy, KL Teo, CHC Little
Discrete mathematics 250 (1-3), 71-78, 2002
402002
Sharp bounds for the number of 3‐independent partitions and the chromaticity of bipartite graphs
FM Dong, KM Koh, KL Teo, CHC Little, MD Hendy
Journal of Graph Theory 37 (1), 48-77, 2001
362001
Introduction to graph theory: H3 mathematics
KM Koh, FM Dong, EG Tay
World Scientific Publishing Company, 2007
342007
On the number of perfect matchings of line graphs
FM Dong, WG Yan, FJ Zhang
Discrete Applied Mathematics 161 (6), 794-801, 2013
332013
Chromaticity of some families of dense graphs
FM Dong, KL Teo, CHC Little, MD Hendy
Discrete Mathematics 258 (1-3), 303-321, 2002
332002
Expression for the number of spanning trees of line graphs of arbitrary connected graphs
FM Dong, WG Yan
Journal of Graph Theory 85 (1), 74-93, 2017
322017
The maximum number of maximal independent sets in unicyclic connected graphs
KM Koh, CY Goh, FM Dong
Discrete mathematics 308 (17), 3761-3769, 2008
292008
Non-chordal graphs having integral-root chromatic polynomials II
FM Dong, KL Teo, KM Koh, MD Hendy
Discrete mathematics 245 (1-3), 247-253, 2002
282002
Zeros of the Jones polynomial are dense in the complex plane
XA Jin, FJ Zhang, FM Dong, EG Tay
The Electronic Journal of Combinatorics 17 (1), R94, 2010
252010
Chromatically unique multibridge graphs
FM Dong, KL Teo, CHC Little, M Hendy, KM Koh
The Electronic Journal of Combinatorics 11 (1), R12, 2004
252004
Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs
J Ge, FM Dong
Discrete Applied Mathematics 283, 542-554, 2020
242020
The rank of a complex unit gain graph in terms of the matching number
SJ He, RX Hao, FM Dong
Linear Algebra and its Applications 589, 158-185, 2020
242020
Two invariants for adjointly equivalent graphs
FM Dong, KL Teo, CHC Little, M Hendy
Australasian Journal of Combinatorics 25, 133-143, 2002
232002
Proof of a chromatic polynomial conjecture
FM Dong
Journal of Combinatorial Theory, Series B 78 (1), 35-44, 2000
232000
On graphs determining links with maximal number of components via medial construction
XA Jin, FM Dong, EG Tay
Discrete applied mathematics 157 (14), 3099-3110, 2009
222009
Uniqueness of the chromatic polynomial of a generalized wheel graph (Chinese)
FM Dong
Journal of Mathematical Research and Exposition 10 (3), 447-452, 1990
22*1990
Determining the component number of links corresponding to lattices
XA Jin, FM Dong, EG Tay
Journal of Knot Theory and its Ramifications 18 (12), 1711-1726, 2009
212009
On chromatic uniqueness of two infinite families of graphs
FM Dong
Journal of graph theory 17 (3), 387-392, 1993
211993
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20