Forest decompositions of graphs with cyclomatic number 3
type: Item
instance of: scholarly article
title: Forest decompositions of graphs with cyclomatic number 3
zbMATH Open document ID: 0535.05023
DOI: 10.1155/S0161171283000484
author: E. J. Farrell
published in: International Journal of Mathematics and Mathematical Sciences
publication date: 1983-01-01T00:00:00Z
full work available at URL: https://eudml.org/doc/45288
review text: A graph G has cyclomatic number n if n is the fewest number of edges whose removal will result in an acyclic graph. Simple tree polynomials of the basic graphs with cyclomatic number 3 are derived. These results are used to develop formulae for the number of spanning trees with specified cardinalities. Expressions are also given for the number of spanning forests and spanning trees in graphs of cyclomatic number 3.
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 3849251
zbMATH Keywords: cyclomatic number
zbMATH Keywords: tree polynomials
zbMATH Keywords: spanning trees
reviewed by: John Mitchem
MaRDI profile type: Publication
OpenAlex ID: W2143306530
description: scientific article; zbMATH DE number 3849251