MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for "The number of spanning trees in circulant graphs." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 6 documents found, showing 1 through 6.
ATOM RSS
  • Reliable Architectures for Networks under Stress  
  • by Guy E. Weichenberg, Vincent W. S. Chan, Muriel Médard — 2003 — Proceedings of the Fourth International Workshop on the Design of Reliable Communication Networks
  • …], Wang and Yang derive the following useful result for the number of spanning trees in circulant graphs…
  • Add To MetaCart
  • High-Reliability Architectures for Networks under Stress  
  • by Guy E. Weichenberg, Vincent W. S. Chan, Muriel Médard — 2003 — Proceedings of the Fourth International Workshop on the Design of Reliable Communication Networks
  • … for the number of spanning trees in circulant graphs. In [9], Boesch and Wang examine the diameter properties…
  • Cited by 3 (1 self) – Add To MetaCart
  • The  
  • by Xuerong Yong Yuanping Zhang, Mordecai J. Golin
  • …) below we derive the formulas for the numbers of spanning trees in the above six graphs to verify…
  • Add To MetaCart
Help! Showing 1 through 6.
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB