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


On the Location of Roots of Independence Polynomials
Authors:JI Brown  CA Hickman  RJ Nowakowski
Institution:(1) Department of Mathematics and Statistics and Faculty of Computer Science, Dalhousie University, Halifax, Nova Scotia, Canada, B3H 3J5;(2) The Fields Institute for Research in Mathematical Sciences, Toronto, Ontario, Canada, M5T 3J1;(3) Department of Mathematics and Statistics, Dalhousie University, Halifax, Nova Scotia, Canada, B3H 3J5
Abstract:The independence polynomial of a graph G is the function i(G, x) = sum kge0 i k x k, where i k is the number of independent sets of vertices in G of cardinality k. We prove that real roots of independence polynomials are dense in (–infin, 0], while complex roots are dense in Copf, even when restricting to well covered or comparability graphs. Throughout, we exploit the fact that independence polynomials are essentially closed under graph composition.
Keywords:graph  independence  polynomial  roots
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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