Introduction to Domination Polynomial of a Graph

Simple item page
dc.creatorAlikhani, Saeid
dc.creatorPeng, Yee-hock
dc.date2009-05-14
dc.date.accessioned2026-07-07T13:14:57Z
dc.date.available2026-07-07T13:14:57Z
dc.descriptionWe introduce a domination polynomial of a graph G. The domination polynomial of a graph G of order n is the polynomial D(G, x) =\sum_{i=1}^n d(G, i)x^i, where d(G, i) is the number of dominating sets of G of size i. We obtain some properties of D(G, x) and its coefficients. Also we compute this polynomial for some specific graphs.
dc.description10 pages. Accepted http://www.combinatorialmath.ca/ArsCombinatoria/index.html
dc.identifierhttps://arxiv.org/abs/0905.2251
dc.identifierhttp://arxiv.org/abs/0905.2251
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/230339
dc.subjectCombinatorics
dc.subject05C69, 11B83
dc.titleIntroduction to Domination Polynomial of a Graph
dc.typetext

Files

Collections

arXiv