activity
20042022
most citedA recursive algorithm for trees and forests

5 citations · 7 across the 7 of their papers we have counts for

collaborators

7 papers

math.CO2022

Disproof of a conjecture on the minimum Wiener index of signed trees

Songlin Guo, Wei Wang, Chuanming Wang

The Wiener index of a connected graph is the sum of distances between all unordered pairs of vertices. Sam Spiro [The Wiener index of signed graphs, Appl. Math. Comput., 416(2022)1…

math.CO2022

On the walk matrix of the Dynkin graph

Wei Wang, Chuanming Wang, Songlin Guo

Let denote the walk matrix of the Dynkin graph , a tree obtained from the path of order by adding a pendant edge at the second vertex. We prove that $\text{rank…

math.CO2017★ 5 cited

A recursive algorithm for trees and forests

Song Guo, Victor J. W. Guo

Trees or rooted trees have been generously studied in the literature. A forest is a set of trees or rooted trees. Here we give recurrence relations between the number of some kind…

math.NT2016

Proof of a recent conjecture of Z.-W. Sun

Song Guo, Victor J. W. Guo

The polynomials are defined by \begin{align*} d_n(x) &= \sum_{k=0}^n{n\choose k}{x\choose k}2^k. \end{align*} We prove that, for any prime , the following congruences h…

math.CO2008★ 1 cited

On Bialostocki's conjecture for zero-sum sequences

Song Guo, Zhi-Wei Sun

Let be a positive even integer, and let and be integers satisfying . A conjecture of Bialostock…

math.NT2008★ 1 cited

A variant of Tao's method with application to restricted sumsets

Song Guo, Zhi-Wei Sun

In this paper, we develop Terence Tao's harmonic analysis method and apply it to restricted sumsets. The well known Cauchy-Davenport theorem asserts that if and are nonempt…