Counting spanning trees in the graphs of Kleitman and Golden and a generalization (Q1061129): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0016-0032(84)90054-1 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2059247311 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Counting Trees in a Certain Class of Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3943047 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Number fields / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Fibonacci numbers via trigonometric expressions / rank | |||
Normal rank |
Latest revision as of 18:17, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Counting spanning trees in the graphs of Kleitman and Golden and a generalization |
scientific article |
Statements
Counting spanning trees in the graphs of Kleitman and Golden and a generalization (English)
0 references
1984
0 references
The number of trees in a graph G on \(n+1\) vertices is, by the celebrated matrix tree theorem, given by the determinant of an \(n\times n\) matrix whose (i-th entry is 1 when G has an edge connecting the i-th and j-th vertices (for i and j between 1 and n) and i-th diagonal element given by minus the degree of the i-th vertex. The authors here use properties of circulant matrices to evaluate this determinant in the case in which the \((n+1)\times (n+1)\) matrix of which this is a cofactor, is a circulant.
0 references