On the total irregularity strength of convex polytope graphs
Abstract A vertex (edge) irregular total k-labeling φ of a graph G is a labeling of the vertices and edges of G with labels from the set {1, 2, . . . , k} in such a way that any two different vertices (edges) have distinct weights. Here, the weight of a vertex x in G is the sum of the label...
Guardado en:
Autores principales: | , , |
---|---|
Lenguaje: | English |
Publicado: |
Universidad Católica del Norte, Departamento de Matemáticas
2021
|
Materias: | |
Acceso en línea: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172021000501267 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
id |
oai:scielo:S0716-09172021000501267 |
---|---|
record_format |
dspace |
spelling |
oai:scielo:S0716-091720210005012672021-10-05On the total irregularity strength of convex polytope graphsBokhary,Syed Ahtsham Ul HaqImran,MuhammadAli,Usman Irregular assignment Vertex irregular total k-labeling Irregularity strength Convex polytopes Abstract A vertex (edge) irregular total k-labeling φ of a graph G is a labeling of the vertices and edges of G with labels from the set {1, 2, . . . , k} in such a way that any two different vertices (edges) have distinct weights. Here, the weight of a vertex x in G is the sum of the label of x and the labels of all edges incident with the vertex x, whereas the weight of an edge is the sum of label of the edge and the vertices incident to that edge. The minimum k for which the graph G has a vertex (edge) irregular total k-labeling is called the total vertex (edge) irregularity strength of G. In this paper, we are dealing with infinite classes of convex polytopes generated by prism graph and antiprism graph. We have determined the exact value of their total vertex irregularity strength and total edge irregularity strength.info:eu-repo/semantics/openAccessUniversidad Católica del Norte, Departamento de MatemáticasProyecciones (Antofagasta) v.40 n.5 20212021-01-01text/htmlhttp://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172021000501267en10.22199/issn.0717-6279-3959 |
institution |
Scielo Chile |
collection |
Scielo Chile |
language |
English |
topic |
Irregular assignment Vertex irregular total k-labeling Irregularity strength Convex polytopes |
spellingShingle |
Irregular assignment Vertex irregular total k-labeling Irregularity strength Convex polytopes Bokhary,Syed Ahtsham Ul Haq Imran,Muhammad Ali,Usman On the total irregularity strength of convex polytope graphs |
description |
Abstract A vertex (edge) irregular total k-labeling φ of a graph G is a labeling of the vertices and edges of G with labels from the set {1, 2, . . . , k} in such a way that any two different vertices (edges) have distinct weights. Here, the weight of a vertex x in G is the sum of the label of x and the labels of all edges incident with the vertex x, whereas the weight of an edge is the sum of label of the edge and the vertices incident to that edge. The minimum k for which the graph G has a vertex (edge) irregular total k-labeling is called the total vertex (edge) irregularity strength of G. In this paper, we are dealing with infinite classes of convex polytopes generated by prism graph and antiprism graph. We have determined the exact value of their total vertex irregularity strength and total edge irregularity strength. |
author |
Bokhary,Syed Ahtsham Ul Haq Imran,Muhammad Ali,Usman |
author_facet |
Bokhary,Syed Ahtsham Ul Haq Imran,Muhammad Ali,Usman |
author_sort |
Bokhary,Syed Ahtsham Ul Haq |
title |
On the total irregularity strength of convex polytope graphs |
title_short |
On the total irregularity strength of convex polytope graphs |
title_full |
On the total irregularity strength of convex polytope graphs |
title_fullStr |
On the total irregularity strength of convex polytope graphs |
title_full_unstemmed |
On the total irregularity strength of convex polytope graphs |
title_sort |
on the total irregularity strength of convex polytope graphs |
publisher |
Universidad Católica del Norte, Departamento de Matemáticas |
publishDate |
2021 |
url |
http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172021000501267 |
work_keys_str_mv |
AT bokharysyedahtshamulhaq onthetotalirregularitystrengthofconvexpolytopegraphs AT imranmuhammad onthetotalirregularitystrengthofconvexpolytopegraphs AT aliusman onthetotalirregularitystrengthofconvexpolytopegraphs |
_version_ |
1718439918767702016 |