On the number of spanning trees of circulant graphs (Q3216668): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Isomorphism of circulant graphs and digraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An algebraic characterization of symmetric graphs with a prime number of vertices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graphs with circulant adjacency matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4044620 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: THE MAXIMUM CONNECTIVITY OF A GRAPH / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Reliable circuits using less reliable relays / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Connectivity of transitive graphs / rank | |||
Normal rank |
Latest revision as of 16:22, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the number of spanning trees of circulant graphs |
scientific article |
Statements
On the number of spanning trees of circulant graphs (English)
0 references
1984
0 references
circulant graph
0 references
spanning trees
0 references