"A Sharp Upper Bound for the Number of Spanning Trees of a Graph."

Kinkar Chandra Das (2007)

> Home

Details and statistics

DOI: 10.1007/S00373-007-0758-4

access: closed

type: Journal Article

metadata version: 2020-06-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/gc/Das07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/gc/Das07
Kinkar Chandra Das:
A Sharp Upper Bound for the Number of Spanning Trees of a Graph. Graphs Comb. 23(6): 625-632 (2007)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.