Dominating Sets and Domination Polynomials of Paths
Copyright policy )Dominating Sets and Domination Polynomials of Paths
Let G = (V, E) be a simple graph. A set S⊆V is a dominating set of G, if every vertex in V\S is adjacent to at least one vertex in S. Let be the family of all dominating sets of a path Pn with cardinality i, and let . In this paper, we construct , and obtain a recursive formula for d(Pn, i). Using this recursive formula, we consider the polynomial , which we call domination polynomial of paths and obtain some properties of this polynomial.
- Universiti Putra Malaysia Malaysia
- Yazd University Iran (Islamic Republic of)
domination polynomial of paths, Artificial intelligence, recursive formula, dominating set, Computer science, Algorithm, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), Engineering, Graph polynomials, Computational Theory and Mathematics, Optical Communication Networks and Energy Efficiency, Computer Science, Physical Sciences, QA1-939, FOS: Electrical engineering, electronic engineering, information engineering, Electrical and Electronic Engineering, Paths and cycles, Mathematics, Graph Theory and Algorithms, Parameterized Complexity
domination polynomial of paths, Artificial intelligence, recursive formula, dominating set, Computer science, Algorithm, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), Engineering, Graph polynomials, Computational Theory and Mathematics, Optical Communication Networks and Energy Efficiency, Computer Science, Physical Sciences, QA1-939, FOS: Electrical engineering, electronic engineering, information engineering, Electrical and Electronic Engineering, Paths and cycles, Mathematics, Graph Theory and Algorithms, Parameterized Complexity
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).29 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 1% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!