Modular irregularity strength of the corona product of graphs
Abstract:
Let G(V, E) be a graph of order n. A modular irregular labeling of G is an edge k-labeling φ: E(G) → {1, 2, …, k} provided that the weight function σ: V (G) → Z<inf>n</inf> defined by σ(u) = wt<inf>φ</inf> (u) =<sup>∑</sup>uv∈E(u) φ(uv) (mod n) is bijective, where E(u) denotes the set of all those edges in E(G) that are incident with the vertex u and Z<inf>n</inf> is the group of integers modulo n. This weight function is called a modular weight of the vertex u. The minimum number k such that the graph G has a modular irregular labeling with the largest label k is called the modular irregularity strength of G. In this paper, we determine the modular irregularity strength of the corona product of a graph G with the edgeless graph of order p (that is, the graph consisting of p isolated vertices) and with the path graph P<inf>3</inf> of order 3, where G is a regular graph containing a 1-factor.
Año de publicación:
2024
Keywords:
- corona product of graphs
- modular irregular labeling
- modular irregularity strength
- Regular graph
Fuente:
scopusTipo de documento:
Article
Estado:
Acceso restringido
Áreas de conocimiento:
- Teoría de grafos
- Algoritmo
- Desconocido
Áreas temáticas de Dewey:
- Principios generales de matemáticas
- Álgebra
- Matemáticas
Objetivos de Desarrollo Sostenible:
- ODS 10: Reducción de las desigualdades
- ODS 16: Paz, justicia e instituciones sólidas
- ODS 17: Alianzas para lograr los objetivos