Hanyuan Deng

collaborators

2 papers

math.CO2024

Higher order invariants of a graph based on the path sequence

Yirong Cai, Zikai Tang, Hanyuan Deng

Let $G = (V, E)$ be a simple and connected graph. A $h$ -order invariant of $G$ based on the path sequence is defined from a set of real numbers $f (x_{0}, x_{1}, \dots, x_{h})$ as $^{h…

math.GM2024

The path sequence of a graph

Yirong Cai, Hanyuan Deng

Let $P (G) = (P_{0} (G), P_{1} (G), \dots, P_{I ¨} (G))$ be the path sequence of a graph $G$ , where $P_{i} (G)$ is the number of paths with length $i$ and $I ¨ $ is the length of a longest path…