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

Independent Domination of Splitted Graphs

A dominating set D of a splitted graph S(G) = ( V, E ) is an independent dominating set if the induced subgraph <D> has no edges. The independent domination number i[S(G)] of a graph S(G) is the minimum cardinality...

Extended Approach to Fuzzy Soft Topological Spaces

In this research paper, we continue the study on fuzzy soft topological spaces and investigate the properties and theorems of fuzzy soft local base point, fuzzy soft contact point. Then discuss the relationship between s...

Some Common Fixed Point Theorems for Weakly Compatible Mappings in Menger Spaces

In this paper,firstly we prove a common fixed point theorem for weakly compatible mappings. Secondly, we prove common fixed point theorems for weakly compatible mappings with E.A and CLR property in Menger spaces. At the...

Geodesic and Exponential Maps on a Riemannian Manifold

Geodesic curve plays an important role in the development of Geometry. Our aim is to ensure local diffeomorphism on a Riemannian manifold which are obtained with the help of exponential mapping.

 Use and application of the External Databases for data organization and storage

 The external databases are some files which stock the information. We can create, edit or recover an immense volume of databases when we shall use the external databases for data organization and storage. AutoCAD o...

Download PDF file
  • EP ID EP99067
  • DOI -
  • Views 82
  • 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