Odd Vertex equitable even labeling of cyclic snake related graphs

Abstract Let G be a graph with p vertices and q edges and A = {1, 3, ..., q} if q is odd or A = {1, 3, ..., q + 1} if q is even. A graph G is said to admit an odd vertex equitable even labeling if there exists a vertex labeling f : V (G) → A that induces an edge labeling f∗ defin...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Jeyanthi,P., Maheswari,A.
Lenguaje:English
Publicado: Universidad Católica del Norte, Departamento de Matemáticas 2018
Materias:
Acceso en línea:http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172018000400613
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
id oai:scielo:S0716-09172018000400613
record_format dspace
spelling oai:scielo:S0716-091720180004006132018-11-05Odd Vertex equitable even labeling of cyclic snake related graphsJeyanthi,P.Maheswari,A. vertex equitable labeling vertex equitable graph odd vertex equitable even labeling odd vertex equitable even graph. Abstract Let G be a graph with p vertices and q edges and A = {1, 3, ..., q} if q is odd or A = {1, 3, ..., q + 1} if q is even. A graph G is said to admit an odd vertex equitable even labeling if there exists a vertex labeling f : V (G) → A that induces an edge labeling f∗ defined by f∗(uv) = f(u) + f(v) for all edges uv such that for all a and b in A, |vf (a) − vf (b)| ≤ 1 and the induced edge labels are 2, 4, ..., 2q where vf (a) be the number of vertices v with f(v) = a for a ∈ A. A graph that admits an odd vertex equitable even labeling is called an odd vertex equitable even graph. Here, we prove that the graph nC4-snake, CS(n1, n2, ..., nk), ni ≡ 0(mod4),ni ≥ 4, be a generalized kCn -snake, TÔQSn and TÕQSn are odd vertex equitable even graphs.info:eu-repo/semantics/openAccessUniversidad Católica del Norte, Departamento de MatemáticasProyecciones (Antofagasta) v.37 n.4 20182018-12-01text/htmlhttp://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172018000400613en10.4067/S0716-09172018000400613
institution Scielo Chile
collection Scielo Chile
language English
topic vertex equitable labeling
vertex equitable graph
odd vertex equitable even labeling
odd vertex equitable even graph.
spellingShingle vertex equitable labeling
vertex equitable graph
odd vertex equitable even labeling
odd vertex equitable even graph.
Jeyanthi,P.
Maheswari,A.
Odd Vertex equitable even labeling of cyclic snake related graphs
description Abstract Let G be a graph with p vertices and q edges and A = {1, 3, ..., q} if q is odd or A = {1, 3, ..., q + 1} if q is even. A graph G is said to admit an odd vertex equitable even labeling if there exists a vertex labeling f : V (G) → A that induces an edge labeling f∗ defined by f∗(uv) = f(u) + f(v) for all edges uv such that for all a and b in A, |vf (a) − vf (b)| ≤ 1 and the induced edge labels are 2, 4, ..., 2q where vf (a) be the number of vertices v with f(v) = a for a ∈ A. A graph that admits an odd vertex equitable even labeling is called an odd vertex equitable even graph. Here, we prove that the graph nC4-snake, CS(n1, n2, ..., nk), ni ≡ 0(mod4),ni ≥ 4, be a generalized kCn -snake, TÔQSn and TÕQSn are odd vertex equitable even graphs.
author Jeyanthi,P.
Maheswari,A.
author_facet Jeyanthi,P.
Maheswari,A.
author_sort Jeyanthi,P.
title Odd Vertex equitable even labeling of cyclic snake related graphs
title_short Odd Vertex equitable even labeling of cyclic snake related graphs
title_full Odd Vertex equitable even labeling of cyclic snake related graphs
title_fullStr Odd Vertex equitable even labeling of cyclic snake related graphs
title_full_unstemmed Odd Vertex equitable even labeling of cyclic snake related graphs
title_sort odd vertex equitable even labeling of cyclic snake related graphs
publisher Universidad Católica del Norte, Departamento de Matemáticas
publishDate 2018
url http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172018000400613
work_keys_str_mv AT jeyanthip oddvertexequitableevenlabelingofcyclicsnakerelatedgraphs
AT maheswaria oddvertexequitableevenlabelingofcyclicsnakerelatedgraphs
_version_ 1718439840055296000