5 citations · 13 across the 29 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
math.CO2023
An Erdős-Stone type result for high-order spectra of graphs
Chunmeng Liu, Jiang Zhou, Changjiang Bu
Erdős-Stone Theorem is a well-known result in extremal graph theory which determines the asymptotic behaviour of maximum number of edges in an -vertex -free graph. In 2009, N…
math.CO2023
Lexicographical ordering of hypergraphs via spectral moment
Hong Zhou, Changjiang Bu
The lexicographical ordering of hypergraphs via spectral moments is called the -order of hypergraphs.In this paper, the -order of hypergraphs is investigated.We characterize…
math.CO2023★ 1 cited
Oriented spanning trees and stationary distribution of digraphs
Jiang Zhou, Changjiang Bu
By using biclique partitions of digraphs, this paper gives reduction formulas for the number of oriented spanning trees, stationary distribution vector and Kemeny's constant of dig…