The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs
type: Item
instance of: scholarly article
title: The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs
zbMATH Open document ID: 1054.05058
author: Stavros D. Nikolopoulos
author: Charis Papadopoulos
published in: Graphs and Combinatorics
publication date: 2005-01-20T00:00:00Z
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C50
zbMATH DE Number: 2130298
zbMATH Keywords: Spanning trres
zbMATH Keywords: Complement spanning-tree matrix theorem
zbMATH Keywords: Trees
zbMATH Keywords: Quasithreshold graphs
zbMATH Keywords: Combinatorial problems
zbMATH Keywords: Networks
MaRDI profile type: Publication
full work available at URL: s00373-004-0568-x
OpenAlex ID: W1997098503
DOI: 10.1007/S00373-004-0568-X
Recommended article: The number of spanning trees in the composition graphs
Recommended article: Q5387677
Recommended article: The number of spanning trees of composite graphs
Recommended article: The number of spanning trees of a complete multipartite graph
Recommended article: The number of spanning trees in some classes of graphs
Recommended article: Q3640122
Recommended article: Q5320577
Recommended article: On the number of spanning trees of \(K_ n\) and \(K_{m,n}\)
Recommended article: Q5294931
Recommended article: On the number of spanning trees of a multi-complete/star related graph
description: scientific article; zbMATH DE number 2130298