Song-Tao Guo

activity

20042022

most citedA recursive algorithm for trees and forests

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

collaborators

Showing math.COShow all

4 papers · 1 filter

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 $D_{n}$

Wei Wang, Chuanming Wang, Songlin Guo

Let $W (D_{n})$ denote the walk matrix of the Dynkin graph $D_{n}$ , a tree obtained from the path of order $n - 1$ 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.CO2008★ 1 cited

On Bialostocki's conjecture for zero-sum sequences

Song Guo, Zhi-Wei Sun

Let $n$ be a positive even integer, and let $a_{1}, ..., a_{n}$ and $w_{1}, ..., w_{n}$ be integers satisfying $\sum_{k = 1}^{n} a_{k} \equiv \sum_{k = 1}^{n} w_{k} = 0 (m o d n)$ . A conjecture of Bialostock…

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

On the walk matrix of the Dynkin graph Dn​

A recursive algorithm for trees and forests

On Bialostocki's conjecture for zero-sum sequences

On the walk matrix of the Dynkin graph $D_{n}$