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


Asymptotics and Arithmetical Properties of Complexity for Circulant Graphs
Authors:A. D. Mednykh  I. A. Mednykh
Affiliation:1.Sobolev Institute of Mathematics, Siberian Branch,Russian Academy of Sciences,Novosibirsk,Russia;2.Novosibirsk State University,Novosibirsk,Russia
Abstract:Abstract—We study analytical and arithmetical properties of the complexity function for infinite families of circulant C n (s1, s2,…, s k ) C2n(s1, s2,…, s k , n). Exact analytical formulas for the complexity functions of these families are derived, and their asymptotics are found. As a consequence, we show that the thermodynamic limit of these families of graphs coincides with the small Mahler measure of the accompanying Laurent polynomials.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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