Sum divisor cordial graphs



Document title: Sum divisor cordial graphs
Journal: Proyecciones (Antofagasta)
Database: PERIÓDICA
System number: 000405936
ISSN: 0716-0917
Authors: 1
1
Institutions: 1St. Xavier's College, Department of Mathematics, Tirunelveli, Tamil Nadu. India
Year:
Season: Mar
Volumen: 35
Number: 1
Pages: 119-136
Country: Chile
Language: Inglés
Document type: Artículo
Approach: Analítico
English abstract A sum divisor cordial labeling of a graph G with vertex set V is a bijection f from V (G) to {1, 2, ··· , |V (G)|} such that an edge uv is assigned the label 1 if 2 divides f(u) + f(v) and 0 otherwise, then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. A graph with a sum divisor cordial labeling is called a sum divisor cordial graph. In this paper, we prove that path, comb, star, complete bipartite, K2 + mK1, bistar, jewel, crown, flower, gear, subdivision of the star, K1,3 ∗ K1,n and square graph of Bn,n are sum divisor cordial graphs
Disciplines: Matemáticas
Keyword: Matemáticas puras,
Combinatoria,
Teoría de gráficas,
Etiquetado
Keyword: Mathematics,
Pure mathematics,
Combinatorics,
Graph theory,
Labelling
Full text: Texto completo (Ver PDF)