Tree counting polynomials for labelled graphs. I: Properties
type: Item
instance of: scholarly article
title: Tree counting polynomials for labelled graphs. I: Properties
zbMATH Open document ID: 0477.05046
DOI: 10.1016/0016-0032(81)90053-3
author: Samuel D. Bedrosian
published in: Journal of the Franklin Institute
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05-02
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C30
zbMATH DE Number: 3749047
zbMATH Keywords: characteristic polynomials
zbMATH Keywords: polynomial representations for connected graphs
zbMATH Keywords: labelled graphs
MaRDI profile type: Publication
full work available at URL: 0016-0032(81)90053-3
OpenAlex ID: W1987546852
cites work: Q5846347
cites work: Q3243274
cites work: Q5616724
cites work: Q4770409
cites work: Nonisomorphic trees with the same T-polynomial
cites work: The characteristic polynomial of a graph
cites work: Stirling number identities from chromatic polynomials
cites work: \(\sigma\)-polynomials and graph coloring
cites work: Comparison of graphs by their number of spanning trees
cites work: Transformations of a graph increasing its Laplacian polynomial and number of spanning trees
cites work: A certain polynomial of a graph and graphs with an extremal number of trees
cites work: Coefficient relationship between rook and chromatic polynomials
cites work: Q5588441
cites work: Generating formulas for the number of trees in a graph
cites work: An Analysis of the Wang Algebra of Networks
cites work: The Determinant of the Adjacency Matrix of a Graph
cites work: Parallel concepts in graph theory
cites work: On a general class of graph polynomials
cites work: Q3869292
description: scientific article; zbMATH DE number 3749047