Sum divisor cordial graphs
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...
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-09172016000100008 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| id |
oai:scielo:S0716-09172016000100008 |
|---|---|
| record_format |
dspace |
| spelling |
oai:scielo:S0716-091720160001000082016-06-14Sum divisor cordial graphsLourdusamy,A.Patrick,F. Sum divisor cordial divisor cordial. 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.info:eu-repo/semantics/openAccessUniversidad Católica del Norte, Departamento de MatemáticasProyecciones (Antofagasta) v.35 n.1 20162016-03-01text/htmlhttp://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172016000100008en10.4067/S0716-09172016000100008 |
| institution |
Scielo Chile |
| collection |
Scielo Chile |
| language |
English |
| topic |
Sum divisor cordial divisor cordial. |
| spellingShingle |
Sum divisor cordial divisor cordial. Lourdusamy,A. Patrick,F. Sum divisor cordial graphs |
| description |
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. |
| author |
Lourdusamy,A. Patrick,F. |
| author_facet |
Lourdusamy,A. Patrick,F. |
| author_sort |
Lourdusamy,A. |
| title |
Sum divisor cordial graphs |
| title_short |
Sum divisor cordial graphs |
| title_full |
Sum divisor cordial graphs |
| title_fullStr |
Sum divisor cordial graphs |
| title_full_unstemmed |
Sum divisor cordial graphs |
| title_sort |
sum divisor cordial 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-09172016000100008 |
| work_keys_str_mv |
AT lourdusamya sumdivisorcordialgraphs AT patrickf sumdivisorcordialgraphs |
| _version_ |
1718439812032102400 |