Laplacian matrix


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

Syndicate content