Edge-Vertex Dominating Sets and Edge-Vertex Domination Polynomials of Cycles

• 作者: A. Vijayan J. Sherin Beula
• 来源期刊: 离散数学期刊(英文)
• 学科: 数学
• 关键词: ev-Domination Set ev-Domination NUMBER ev-Domination POLYNOMIALS
• 年，卷（期）: 2015,（4）
• 页码范围: 74-87
• 页数: 14页
• 分类号: O1

摘要

Let G = (V, E) be a simple graph. A set S E(G) is an edge-vertex dominating set of G (or simply an ev-dominating set), if for all vertices v V(G);there exists an edge eS such that e dominates v. Let denote the family of all ev-dominating sets of with cardinality i. Let . In this paper, we obtain a recursive formula for . Using this recursive formula, we construct the polynomial, , which we call edge-vertex domination polynomial of (or simply an ev-domination polynomial of ) and obtain some properties of this polynomial.