Home » Keyword index

degree sequence


Graph Theory » Algebraic G.T.

Laplacian Degrees of a Graph ★★

Author(s): Guo

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 $.

Keywords: degree sequence; Laplacian matrix

Posted by Robert Samal
updated February 29th, 2008
2 comments
Syndicate content