A study on prime arithmetic integer additive set-indexers of graphs
Abstract: Let N0 be the set of all non-negative integers and P(N0) be its power set. An integer additive set-indexer (IASI) is defined as an injective function such that the induced function defined by is also injective, where N0 is the set of all non-negative integers. A graph G which admits an...
Guardado en:
| Autores principales: | , |
|---|---|
| Lenguaje: | English |
| Publicado: |
Universidad Católica del Norte, Departamento de Matemáticas
2017
|
| Materias: | |
| Acceso en línea: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172017000200195 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Sumario: | Abstract: Let N0 be the set of all non-negative integers and P(N0) be its power set. An integer additive set-indexer (IASI) is defined as an injective function such that the induced function defined by is also injective, where N0 is the set of all non-negative integers. A graph G which admits an IASI is called an IASI graph. An IASI of a graph G is said to be an arithmetic IASI if the elements of the set-labels of all vertices and edges of G are in arithmetic progressions. In this paper, we discuss about a particular type of arithmetic IASI called prime arithmetic IASI. |
|---|