Vertex equitable labeling of union of cyclic snake related graphs
Let G be a graph with p vértices and q edges and A = {0,1, 2,..., q/2}. A vertex labeling f : V(G) → A induces an edge labeling f * defined by f *(uv) = f (u) + f (v) for all edges uv. For a ∈ A, let v f (a) be the number of vertices v with f (v) = a. A graph G is said to be vert...
Guardado en:
| Autores principales: | , , |
|---|---|
| Lenguaje: | English |
| Publicado: |
Universidad Católica del Norte, Departamento de Matemáticas
2016
|
| Materias: | |
| Acceso en línea: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172016000200003 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| id |
oai:scielo:S0716-09172016000200003 |
|---|---|
| record_format |
dspace |
| spelling |
oai:scielo:S0716-091720160002000032016-05-30Vertex equitable labeling of union of cyclic snake related graphsJeyanthi,P.Maheswari,A.Vijayalakshmi,M. Vertex equitable labeling vertex equitable graph comb graph key graph path union graph quadrilateral snake graph Let G be a graph with p vértices and q edges and A = {0,1, 2,..., q/2}. A vertex labeling f : V(G) → A induces an edge labeling f * defined by f *(uv) = f (u) + f (v) for all edges uv. For a ∈ A, let v f (a) be the number of vertices v with f (v) = a. A graph G is said to be vertex equitable if there exists a vertex labeling f such that for all a and b in A, |v f(a) - v f b)| ≤ 1 and the induced edge labels are 1, 2, 3,...,q. In this paper, we prove that key graph KY(m, n), P(2.QSn), P(m.QSn), C(n.QSm), NQ(m) and K1,n X P2are vertex equitable graphs.info:eu-repo/semantics/openAccessUniversidad Católica del Norte, Departamento de MatemáticasProyecciones (Antofagasta) v.35 n.2 20162016-06-01text/htmlhttp://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172016000200003en10.4067/S0716-09172016000200003 |
| institution |
Scielo Chile |
| collection |
Scielo Chile |
| language |
English |
| topic |
Vertex equitable labeling vertex equitable graph comb graph key graph path union graph quadrilateral snake graph |
| spellingShingle |
Vertex equitable labeling vertex equitable graph comb graph key graph path union graph quadrilateral snake graph Jeyanthi,P. Maheswari,A. Vijayalakshmi,M. Vertex equitable labeling of union of cyclic snake related graphs |
| description |
Let G be a graph with p vértices and q edges and A = {0,1, 2,..., q/2}. A vertex labeling f : V(G) → A induces an edge labeling f * defined by f *(uv) = f (u) + f (v) for all edges uv. For a ∈ A, let v f (a) be the number of vertices v with f (v) = a. A graph G is said to be vertex equitable if there exists a vertex labeling f such that for all a and b in A, |v f(a) - v f b)| ≤ 1 and the induced edge labels are 1, 2, 3,...,q. In this paper, we prove that key graph KY(m, n), P(2.QSn), P(m.QSn), C(n.QSm), NQ(m) and K1,n X P2are vertex equitable graphs. |
| author |
Jeyanthi,P. Maheswari,A. Vijayalakshmi,M. |
| author_facet |
Jeyanthi,P. Maheswari,A. Vijayalakshmi,M. |
| author_sort |
Jeyanthi,P. |
| title |
Vertex equitable labeling of union of cyclic snake related graphs |
| title_short |
Vertex equitable labeling of union of cyclic snake related graphs |
| title_full |
Vertex equitable labeling of union of cyclic snake related graphs |
| title_fullStr |
Vertex equitable labeling of union of cyclic snake related graphs |
| title_full_unstemmed |
Vertex equitable labeling of union of cyclic snake related graphs |
| title_sort |
vertex equitable labeling of union of cyclic snake related graphs |
| publisher |
Universidad Católica del Norte, Departamento de Matemáticas |
| publishDate |
2016 |
| url |
http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172016000200003 |
| work_keys_str_mv |
AT jeyanthip vertexequitablelabelingofunionofcyclicsnakerelatedgraphs AT maheswaria vertexequitablelabelingofunionofcyclicsnakerelatedgraphs AT vijayalakshmim vertexequitablelabelingofunionofcyclicsnakerelatedgraphs |
| _version_ |
1718439812902420480 |