A certain polynomial of a graph and graphs with an extremal number of trees

  • Kelmans A
  • Chelnokov V
  • 4


    Mendeley users who have this article in their library.
  • 109


    Citations of this article.


The polynomial we consider here is the characteristic polynomial of a certain (not adjacency) matrix associated with a graph. This polynomial was introduced in connection with the problem of counting spanning trees in graphs [8]. In the present paper the properties of this polynomial are used to construct some classes of graphs with an extremal numbers of spanning trees. © 1974.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • A. K. Kelmans

  • V. M. Chelnokov

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free