Equitable Graph of a Graph
A subset D of V is called an equitable dominating set if for every v G V - D there exists a vertex u G D such that uv G E(G) and \d(u) - d(v)\ < 1,where d(u) denotes the degree of vertex u and d(v) denotes the degree of vertex v. The minimum cardinality of such a dominating set is denoted by Je a...
Guardado en:
| Autor principal: | |
|---|---|
| Lenguaje: | English |
| Publicado: |
Universidad Católica del Norte, Departamento de Matemáticas
2012
|
| Materias: | |
| Acceso en línea: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172012000400005 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Sumario: | A subset D of V is called an equitable dominating set if for every v G V - D there exists a vertex u G D such that uv G E(G) and \d(u) - d(v)\ < 1,where d(u) denotes the degree of vertex u and d(v) denotes the degree of vertex v. The minimum cardinality of such a dominating set is denoted by Je and is called the equitable domination number of G.Degree Equitable domination on Graphs were introduced in [10].This Paper aims at the study of a new concept called equitable graph ofa graph introduced by Prof. E. Sampathkumar. In this paper we show that there is relation between j(Ge) and ãe(G). Further results on the new parameter j(Ge) are discussed. |
|---|