"Graph entropy based on the number of spanning forests of c-cyclic ..."

Pengfei Wan et al. (2019)

> Home

Details and statistics

DOI: 10.1016/J.AMC.2019.124616

access: closed

type: Journal Article

metadata version: 2025-01-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/amc/WanTDZE19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/amc/WanTDZE19
Pengfei Wan, Jianhua Tu, Matthias Dehmer, Shenggui Zhang, Frank Emmert-Streib:
Graph entropy based on the number of spanning forests of c-cyclic graphs. Appl. Math. Comput. 363 (2019)

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.