On Symmetry of Independence Polynomials 英文参考文献.docVIP

Symmetry2011,3,472-486;doi:10.3390/sym3030472 OPENACCESS symmetry ISSN2073-8994 /journal/symmetry Article OnSymmetryofIndependencePolynomials VadimE.Levit 1,?andEugenMandrescu 2 1 DepartmentofComputerScienceandMathematics,ArielUniversityCenterofSamaria,Kiryat HaMada,Ariel40700,Israel 2 DepartmentofComputerScience,HolonInstituteofTechnology,52GolombStreet,Holon58102, Israel;E-Mail:eugenm@hit.ac.il ? Authortowhomcorrespondenceshouldbeaddressed;E-Mail:levitv@ariel.ac.il; Tel.:+972-3-9066163;Fax:+972-3-9066692. Received:27April2011;inrevisedform:20June2011/Accepted:22June2011/ Published:15July2011 Abstract: An independent set in a graph is a set of pairwise non-adjacent vertices, and α(G) is the size of a maximum independent set in the graph G. A matching is a set of non-incident edges, while μ(G) is the cardinality of a maximum matching. If sk is the numberofindependentsetsofsizekinG,thenI(G;x) = s0+s1x+s2x , +...+sαx 2 α α = α(G), is called the independence polynomial of G (Gutman and Harary, 1986). If sj = s forall0 ≤ j ≤ bα/2c,thenI(G;x)iscalledsymmetric(orpalindromic). Itis α?j knownthatthegraphG?2K ,obtainedbyjoiningeachvertexofGtotwonewvertices,has 1 asymmetricindependencepolynomial(Stevanovi′c,1998). Inthispaperwedevelopanew algebraictechniqueinordertotakecareofsymmetricindependencepolynomials. Onthe onehand,itprovidesuswithalternativeproofsforsomepreviouslyknownresults. Onthe otherhand,thistechniqueallowstoshowthatforeverygraphGandforeachnon-negative integerk ≤ μ(G),onecanbuildagraphH,suchthat: GisasubgraphofH,I(H;x)is symmetric,andI(G?2K ;x)=(1+x) k ·I(H;x). 1 Keywords: independent set; independence polynomial; symmetric polynomial; palindromicpolynomial Classi?cation:MSC 05C31;05C69  Symmetry2011,3 473 1. Introduction ThroughoutthispaperG=(V,E)isasimple(i.e.,a?nite,undirected,looplessandwithoutmultiple edges)graphwithvertexsetV =V(G)andedgesetE=E(G).IfX ?V,thenG[X]isthesubgraph ofGspannedbyX.