Author

Yong‐De Feng

0 works0 citationsORCID

Recent research

  • AI & ComputingOpen access

    The number of odd spanning trees in almost multipartite graphs

    This paper combines the Weighted Matrix-Tree Theorem with Boolean function analysis and the Schur complement decomposition method to study the enumeration of odd spanning trees, in which every vertex has odd degree, in almost multipartite graphs, and derives an explicit formula f...

    Applied Mathematics and Computation2026-10-170 citationsDOI