典型文献
Unimodality of Independence Polynomials of the Cycle Cover Product of Graphs
文献摘要：
An independent set in a graph G is a set of pairwise non-adjacent vertices.Let ik(G)denote the number of independent sets of cardinality k in G.Then its generating function I(G;x)=α(G)∑k=0 ik(G)xk is called the independence polynomial of G(Gutman and Harary,1983).In this paper,we introduce a new graph operation called the cycle cover product and formulate its independence polynomial.We also give a criterion for formulating the independence polynomial of a graph.Based on the exact formulas,we prove some results on symmetry,unimodality,reality of zeros of independence polynomials of some graphs.As applications,we give some new constructions for graphs having symmetric and unimodal independence polynomials.
文献关键词：
中图分类号：
作者姓名：
Bao Xuan ZHU
作者机构：
School of Mathematics and Statistics,Jiangsu Normal University,Xuzhou 221116,P.R.China
文献出处：
引用格式：
[1]Bao Xuan ZHU-.Unimodality of Independence Polynomials of the Cycle Cover Product of Graphs)[J].数学学报（英文版）,2022(05):858-868
A类：
Unimodality,ik,Gutman,Harary,unimodality
B类：
Independence,Polynomials,Cycle,Cover,Product,Graphs,An,independent,pairwise,adjacent,vertices,Let,denote,number,sets,cardinality,Then,its,generating,function,xk,called,independence,this,paper,we,introduce,new,operation,cycle,cover,product,formulate,We,also,give,criterion,formulating,Based,exact,formulas,prove,some,results,symmetry,reality,zeros,polynomials,graphs,applications,constructions,having,symmetric
AB值：
0.538701
相似文献
机标中图分类号，由域田数据科技根据网络公开资料自动分析生成，仅供学习研究参考。
