# Guo, Ji-Ming

## Laplacian Degrees of a Graph ★★

Author(s): Guo

\begin{conjecture} If $G$ is a connected graph on $n$ vertices, then $c_k(G) \ge d_k(G)$ for $k = 1, 2, \dots, n-1$. \end{conjecture}

Keywords: degree sequence; Laplacian matrix

Author(s): Guo

Keywords: degree sequence; Laplacian matrix

- Subject
- Algebra (6)
- Analysis (5)
- Combinatorics (36)
- Geometry (28)
- Graph Theory (222)
- Group Theory (5)
- Logic (10)
- Number Theory (47)
- Theoretical Comp. Sci. (13)
- Topology (40)
- Unsorted (1)

- Author index
- Keyword index