Connected graphs with a minimal number of spanning trees
type: Item
instance of: scholarly article
title: Connected graphs with a minimal number of spanning trees
zbMATH Open document ID: 0403.05029
DOI: 10.1016/0095-8956(81)90061-7
published in: Journal of Combinatorial Theory. Series B
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C30
zbMATH DE Number: 3625417
zbMATH Keywords: Matrix Associated with a Graph
zbMATH Keywords: Connected Graphs
zbMATH Keywords: Minimal Number
author: Norbert Gaffke
MaRDI profile type: Publication
full work available at URL: 0095-8956(81)90061-7
OpenAlex ID: W2084609044
cites work: Q5572939
cites work: Q5636912
cites work: A certain polynomial of a graph and graphs with an extremal number of trees
cites work: Q4087208
description: scientific article; zbMATH DE number 3625417