首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Aztec Diamonds, Checkerboard Graphs, and Spanning Trees
Authors:Donald E Knuth
Institution:(1) Department of Computer Science, Stanford University, Stanford, CA, 94305–9045
Abstract:This note derives the characteristic polynomial of a graph that represents nonjump moves in a generalized game of checkers. The number of spanning trees is also determined.
Keywords:Aztec diamond  spanning tree  graph spectra  enumeration
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号