◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

F. Dong

27 papers hereh-index 15941 citations111 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author5
  • first author10
  • middle author2
  • last author9

Across the 26 of 27 papers where every author was matched, so the position is known.

fields
  • math.CO27
same name
  • F. Dong — 58 papers, h 24
  • F. Dong — 7 papers, h 12
  • F. Dong — 5 papers, h 25
  • F. Dong — 5 papers, h 4
  • F. Dong — 4 papers, h 3
  • F. Dong — 4 papers, h 6

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20152023
most citedExpression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs

36 citations · 70 across the 26 of their papers we have counts for

collaborators
Showing 2023Show all

4 papers · 1 filter

math.CO2023★ 2 cited

On the maximum local mean order of sub-k-trees of a k-tree

Zhuo Li, Tianlong Ma, Fengming Dong +1

For a k-tree T, a generalization of a tree, the local mean order of sub-k-trees of T is the average order of sub-k-trees of T containing a given k-clique. The problem whether the l…

math.CO2023

The absolute values of the perfect matching derangement graph's eigenvalues almost follow the lexicographic order of partitions

Meiqiao Zhang, Fengming Dong

In 2013, Ku and Wong showed that for any partitions μ and μ′ of a positive integer n with the same first part u and the lexicographic order μ◃μ′, the eigenva…

math.CO2023

Comparing list-color functions of uniform hypergraphs with their chromatic polynomials

Fengming Dong, Meiqiao Zhang

In [J. Combin. Theory Ser. B 161 (2023), 109--119], the authors showed that the list-color function Pl​(G,k) of any simple graph G of size m coincides with its chromatic poly…

math.CO2023

Compare list-color functions of uniform hypergraphs with their chromatic polynomials (II)

Meiqiao Zhang, Fengming Dong

For any r-uniform hypergraph H with m (≥2) edges, let P(H,k) and Pl​(H,k) be the chromatic polynomial and the list-color function of $…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.