On Jacobian group and complexity of \(I\)-graph \(I(n, k, l)\) through Chebyshev polynomials (Q4629559)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7043568
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Jacobian group and complexity of \(I\)-graph \(I(n, k, l)\) through Chebyshev polynomials |
scientific article; zbMATH DE number 7043568 |
Statements
On Jacobian group and complexity of I-graph I(n, k, l) through Chebyshev polynomials (English)
0 references
27 March 2019
0 references
spanning tree
0 references
Jacobian group
0 references
I-graph
0 references
Petersen graph
0 references
Chebyshev polynomial
0 references
0 references
0.8641761541366577
0 references
0.7458530068397522
0 references
0.7395456433296204
0 references
0.7391716837882996
0 references
0.7188591957092285
0 references
