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

作　　者：A. Vijayan J. Sherin Beula 

机构地区：[1]Department of Mathematics, Nesamony Memorial Christian College, Marthandam, India [2]Department of Mathematics, Mar Ephraem College of Engineering & Technology, Marthandam, India

出　　处：《Open Journal of Discrete Mathematics》2015年第4期74-87,共14页离散数学期刊（英文）

摘　　要：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.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.

关 键 词：ev-Domination Set ev-Domination NUMBER ev-Domination POLYNOMIALS 

分 类 号：O1[理学—数学]