Counting the number of spanning trees in a class of double fixed-step loop networks
release_7bnhto7rgjhmdcm2vtapyvbv3u
by
Talip Atajan, Naohisa Otsuka, Xuerong Yong
Cited By
References to this release by other works.Showing 1 - 3 of 3 references (in 852ms) | ||
---|---|---|
via crossref |
Spanning trees in directed circulant graphs and cycle power graphs
Justine Louis 2016 Monatshefte für Mathematik (Print) doi:10.1007/s00605-016-0912-2 | |
via crossref |
The Number of Spanning Trees of the Cartesian Product of Regular Graphs
Mei-Hui Wu, Long-Yeu Chung 2014 Mathematical Problems in Engineering doi:10.1155/2014/750618 |
web.archive.org [PDF]
|
via crossref |
An efficient approach for counting the number of spanning trees in circulant and related graphs
Talip Atajan, Xuerong Yong, Hiroshi Inaba 2010 Discrete Mathematics doi:10.1016/j.disc.2009.11.033 |
web.archive.org [PDF]
|