Sum divisor cordial labeling for star and ladder related graphs

Sum divisor cordial labeling for star and ladder related graphs

A sum divisor cordial labeling of a graph G with vertex set V is a bijection f from V 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; and the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1....

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Lourdusamy,A, Patrick,F
Lenguaje:English
Publicado: Universidad Católica del Norte, Departamento de Matemáticas 2016
Materias:
Divisor cordial
sum divisor cordial
Acceso en línea:http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172016000400006
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
id oai:scielo:S0716-09172016000400006
record_format dspace
spelling oai:scielo:S0716-091720160004000062017-01-05Sum divisor cordial labeling for star and ladder related graphsLourdusamy,APatrick,F Divisor cordial sum divisor cordial A sum divisor cordial labeling of a graph G with vertex set V is a bijection f from V 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; and 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 D2(K1,n), S' (K1,n), D2(Bn,n), DS(Bn,n), S' (Bn,n), S(Bn,n), < K(1)1,n&#916;K(2)1,n&gt;, S(Ln), Ln O K1, SLn, TLn, TLn O Ki and CHn are sum divisor cordial graphs.info:eu-repo/semantics/openAccessUniversidad Católica del Norte, Departamento de MatemáticasProyecciones (Antofagasta) v.35 n.4 20162016-12-01text/htmlhttp://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172016000400006en10.4067/S0716-09172016000400006
institution Scielo Chile
collection Scielo Chile
language English
topic Divisor cordial
sum divisor cordial
spellingShingle Divisor cordial
sum divisor cordial
Lourdusamy,A
Patrick,F
Sum divisor cordial labeling for star and ladder related graphs
description A sum divisor cordial labeling of a graph G with vertex set V is a bijection f from V 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; and 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 D2(K1,n), S' (K1,n), D2(Bn,n), DS(Bn,n), S' (Bn,n), S(Bn,n), < K(1)1,n&#916;K(2)1,n&gt;, S(Ln), Ln O K1, SLn, TLn, TLn O Ki and CHn are sum divisor cordial graphs.
author Lourdusamy,A
Patrick,F
author_facet Lourdusamy,A
Patrick,F
author_sort Lourdusamy,A
title Sum divisor cordial labeling for star and ladder related graphs
title_short Sum divisor cordial labeling for star and ladder related graphs
title_full Sum divisor cordial labeling for star and ladder related graphs
title_fullStr Sum divisor cordial labeling for star and ladder related graphs
title_full_unstemmed Sum divisor cordial labeling for star and ladder related graphs
title_sort sum divisor cordial labeling for star and ladder 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-09172016000400006
work_keys_str_mv AT lourdusamya sumdivisorcordiallabelingforstarandladderrelatedgraphs
AT patrickf sumdivisorcordiallabelingforstarandladderrelatedgraphs
_version_ 1718439817803464704

Ejemplares similares