A new upper bound on the number of spanning trees of a graph

Authors

  • Li, Rao

Abstract

A new upper bound involving the(-1)-Randić index for the number of spanning trees of a graph is presented in this note.

Published

2013-06-09

How to Cite

Li, Rao. (2013). A new upper bound on the number of spanning trees of a graph. Utilitas Mathematica, 91. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/960

Issue

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.