A positive combinatorial formula for the complexity of the \(q\)-analog of the \(n\)-cube (Q426914): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
Summary: The number of spanning trees of a graph \(G\) is called the complexity of \(G\). A classical result in algebraic graph theory explicitly diagonalizes the Laplacian of the \(n\)-cube \(C(n)\) and yields, using the Matrix-Tree theorem, an explicit formula for \(c(C(n))\). In this paper we explicitly block diagonalize the Laplacian of the \(q\)-ana\(\log C_q(n)\) of \(C(n)\) and use this, along with the Matrix-Tree theorem, to give a positive combinatorial formula for \(c(C_q(n))\). We also explain how setting \(q=1\) in the formula for \(c(C_q(n))\) recovers the formula for \(c(C(n))\). | |||
Property / review text: Summary: The number of spanning trees of a graph \(G\) is called the complexity of \(G\). A classical result in algebraic graph theory explicitly diagonalizes the Laplacian of the \(n\)-cube \(C(n)\) and yields, using the Matrix-Tree theorem, an explicit formula for \(c(C(n))\). In this paper we explicitly block diagonalize the Laplacian of the \(q\)-ana\(\log C_q(n)\) of \(C(n)\) and use this, along with the Matrix-Tree theorem, to give a positive combinatorial formula for \(c(C_q(n))\). We also explain how setting \(q=1\) in the formula for \(c(C_q(n))\) recovers the formula for \(c(C(n))\). / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05A15 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C50 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05E30 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6045727 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
spanning trees | |||
Property / zbMATH Keywords: spanning trees / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Matrix-Tree theorem | |||
Property / zbMATH Keywords: Matrix-Tree theorem / rank | |||
Normal rank |
Revision as of 22:59, 29 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A positive combinatorial formula for the complexity of the \(q\)-analog of the \(n\)-cube |
scientific article |
Statements
A positive combinatorial formula for the complexity of the \(q\)-analog of the \(n\)-cube (English)
0 references
12 June 2012
0 references
Summary: The number of spanning trees of a graph \(G\) is called the complexity of \(G\). A classical result in algebraic graph theory explicitly diagonalizes the Laplacian of the \(n\)-cube \(C(n)\) and yields, using the Matrix-Tree theorem, an explicit formula for \(c(C(n))\). In this paper we explicitly block diagonalize the Laplacian of the \(q\)-ana\(\log C_q(n)\) of \(C(n)\) and use this, along with the Matrix-Tree theorem, to give a positive combinatorial formula for \(c(C_q(n))\). We also explain how setting \(q=1\) in the formula for \(c(C_q(n))\) recovers the formula for \(c(C(n))\).
0 references
spanning trees
0 references
Matrix-Tree theorem
0 references