Odd vertex equitable even labeling of graphs



Título del documento: Odd vertex equitable even labeling of graphs
Revista: Proyecciones (Antofagasta)
Base de datos: PERIÓDICA
Número de sistema: 000405878
ISSN: 0716-0917
Autores: 1
2
3
Instituciones: 1Govindammal Aditanar College for Women, Department of Mathematics, Thoothukudi, Tamil Nadu. India
2Kamaraj College of Engineering and Technology, Department of Mathematics, Virudhunagar, Tamil Nadu. India
3Dr. G.U. Pope College of Engineering, Department of Mathematics, Thoothukudi, Tamil Nadu. India
Año:
Periodo: Mar
Volumen: 36
Número: 1
Paginación: 1-11
País: Chile
Idioma: Inglés
Tipo de documento: Artículo
Enfoque: Analítico
Resumen en inglés In this paper, we introduce a new labeling called odd vertex equitable even labeling. 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 odd vertex equitable even labeling is called odd vertex equitable even graph. We investigate the odd vertex equitable even behavior of some standard graphs
Disciplinas: Matemáticas
Palabras clave: Matemáticas puras,
Combinatoria,
Teoría de gráficas,
Etiquetado
Keyword: Mathematics,
Pure mathematics,
Combinatorics,
Graph theory,
Labelling
Texto completo: Texto completo (Ver PDF)