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

Journal Title: INTERNATIONAL JOURNAL OF MATHEMATICS TRENDS AND TECHNOLOGY - Year 2013, Vol 4, Issue 11

Abstract

Let G = (V, E) be a simple Graph. A set S  V(G) is a vertex-edge dominating set (or simplyve-dominating set) if for all edges e  E(G), there exist a vertex v  S such that v dominates e. In this paper, we study the concept of vertex-edge domination polynomial of the path Pn. The vertex-edge domination polynomial of Pn is Dve(Pn, x) = dve(Pn, i)xi, where dve(Pn, i) is the number of vertex edge dominating sets of Pn with cardinality i. We obtain some properties of Dve(Pn, x) and its co-efficients. Also, we calculate the recursive formula to derive the vertex-edge domination polynomials of paths.

Authors and Affiliations

A. Vijayan , T. Nagarajan

Keywords

Related Articles

A New Approach to Robust Partial Least Squares Regression Analysis

Partial Least Squares Regression (PLSR) is a linear regression technique developed to relate many independent variables to one or several dependent variables. Robust methods are introduced to reduce or remove the effects...

 Single Objective Evolutionary Algorithm for Flexible Job-shop Scheduling Problem

 - A meta-heuristic approach for solving the flexible job-shop scheduling problem (FJSP) is presented in this study. This problem consists of two sub-problems, the routing problem and the sequencing problem and is...

Numerical Solution of Fuzzy Differential Equations by Extended Runge-Kutta Method and the Dependency Problem

In this paper we use extended Runge-Kutta-like formulae of order four (ERK4) and of order five (ERK5) by taking into account the dependency problem that arises in fuzzy setting. This method is adopted to solve the depend...

 Bulk Arrival Two Phase Retrial Queue with Two Types Service and Extended Bernoulli Vacation

 This paper is concerned with the analysis of a single server batch arrival retrial queueing system with optional extended server vacation. Server provides two stages of heterogeneous service in succession. Each...

On Some Generalized Well Known Results of Fixed Point Theorems of T- Contraction Mappings in Cone Metric Spaces

In this paper, we obtain sufficient conditions for the existence of a common fixed point of T- Contraction mapping in the setting on complete cone metric spaces. Our results generalized well known recent result of Garg a...

Download PDF file
  • EP ID EP99067
  • DOI -
  • Views 100
  • Downloads 0

How To Cite

A. Vijayan, T. Nagarajan (2013). Vertex- Edge Dominating Sets and Vertex-Edge Domination Polynomials of Paths. INTERNATIONAL JOURNAL OF MATHEMATICS TRENDS AND TECHNOLOGY, 4(11), 266-279. https://europub.co.uk/articles/-A-99067