3 papers
math.CO2024
Ultra log-concavity and real-rootedness of dependence polynomials
Yan-Ting Xie, Shou-Jun Xu
For some positive integer , a real polynomial with is called log-concave (resp. ultra log-concave) if $a_k^2\geqslant a_{k-1}a_…
math.CO2024
Solution to a conjecture on resistance distances of block tower graphs
Wensheng Sun, Yujun Yang, Wuxian Chen +1
Let be a connected graph. The resistance distance between two vertices and of , denoted by , is defined as the net effective resistance between them in t…
math.CO2024
Perfect codes in circulant graphs of degree
Xiaomeng Wang, Oriol Serra, Shou-Jun Xu +1
A perfect code in a graph is an independent set of the graph such that every vertex outside the set is adjacent to exactly one vertex in the set. A circulant graph is a Cayley grap…