Complementary nil vertex edge dominating sets
| Autor: | I. H. Nagaraja Rao, S. V. Siva Rama Raju |
|---|---|
| Rok vydání: | 2015 |
| Předmět: |
Discrete mathematics
Vertex (graph theory) Domination analysis General Mathematics Complementary nil vertex edge domination Neighbourhood (graph theory) Edge dominating set Edge cover Bidimensionality connected domination Combinatorics complementary nil vertex edge domination number Dominating set Feedback vertex set Mathematics |
| Zdroj: | Proyecciones (Antofagasta) v.34 n.1 2015 SciELO Chile CONICYT Chile instacron:CONICYT Proyecciones (Antofagasta), Volume: 34, Issue: 1, Pages: 1-13, Published: 30 MAR 2015 |
| ISSN: | 0716-0917 |
| Popis: | Dominating sets play a vital role in day-to-day life problems. For-providing effective services in a location, central points are to be identified. This can easily be achieved by graph theoretic techniques. Such graphs and relevant parameters are introduced and extensively studied. One such parameter is complementary nil vertex edge dominating set(cnved-set). A vertex edge dominating set(ved-set) of a connected graph G with vertex set V is said to be a complementary nil vertex edge dominating set(cnved-Set) of G if and only if V - D is not a ved-set of G. A cnved-set of minimum cardinality is called a minimum cnved-set(mcnved-set)of G and this minimum cardinality is called the complementary nil vertex-edge domination number of G and is denoted by γcnve(G). We have given a characterization result for a ved-set to be a cnved-set and also bounds for this parameter are obtained. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|