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...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autor principal:	Dharmalingam,Kuppusamy
Lenguaje:	English
Publicado:	Universidad Católica del Norte, Departamento de Matemáticas 2012
Materias:	Degree Equitable Number Equitable Graph of a Graph.
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!

id	oai:scielo:S0716-09172012000400005
record_format	dspace
spelling	oai:scielo:S0716-091720120004000052012-12-18Equitable Graph of a GraphDharmalingam,Kuppusamy Degree Equitable Number 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 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.info:eu-repo/semantics/openAccessUniversidad Católica del Norte, Departamento de MatemáticasProyecciones (Antofagasta) v.31 n.4 20122012-12-01text/htmlhttp://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172012000400005en10.4067/S0716-09172012000400005
institution	Scielo Chile
collection	Scielo Chile
language	English
topic	Degree Equitable Number Equitable Graph of a Graph.
spellingShingle	Degree Equitable Number Equitable Graph of a Graph. Dharmalingam,Kuppusamy Equitable Graph of a Graph
description	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.
author	Dharmalingam,Kuppusamy
author_facet	Dharmalingam,Kuppusamy
author_sort	Dharmalingam,Kuppusamy
title	Equitable Graph of a Graph
title_short	Equitable Graph of a Graph
title_full	Equitable Graph of a Graph
title_fullStr	Equitable Graph of a Graph
title_full_unstemmed	Equitable Graph of a Graph
title_sort	equitable graph of a graph
publisher	Universidad Católica del Norte, Departamento de Matemáticas
publishDate	2012
url	http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172012000400005
work_keys_str_mv	AT dharmalingamkuppusamy equitablegraphofagraph
_version_	1718439786400710656

Equitable Graph of a Graph

Ejemplares similares