Number of Spanning Trees of Cartesian and Composition Products of Graphs and Chebyshev Polynomials
Enumerating all the spanning trees of a graph without duplication is one of the widely studied problems in electrical engineering and computer science literature. Since the number of spanning trees increases rapidly with the size of the graphs, a highly efficient method desired to compute all the sp...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2019-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/8717642/ |