Modular total vertex irregularity strength of graphs
A (modular) vertex irregular total labeling of a graph G of order n is an assignment of positive integers from 1 to k to the vertices and edges of G with the property that all vertex weights are distinct. The vertex weight of a vertex v is defined as the sum of numbers assigned to the vertex v itsel...
Main Authors: | Gohar Ali, Martin Bača, Marcela Lascsáková, Andrea Semaničová-Feňovčíková, Ahmad ALoqaily, Nabil Mlaiki |
---|---|
Format: | Article |
Language: | English |
Published: |
AIMS Press
2023-01-01
|
Series: | AIMS Mathematics |
Subjects: | |
Online Access: | https://www.aimspress.com/article/doi/10.3934/math.2023384?viewType=HTML |
Similar Items
-
The Irregularity and Modular Irregularity Strength of Fan Graphs
by: Martin Bača, et al.
Published: (2021-04-01) -
Modular Version of Edge Irregularity Strength for Fan and Wheel Graphs
by: Debi Oktia Haryeni, et al.
Published: (2022-12-01) -
Modular edge irregularity strength of graphs
by: Ali N. A. Koam, et al.
Published: (2023-01-01) -
Irregularity and Modular Irregularity Strength of Wheels
by: Martin Bača, et al.
Published: (2021-10-01) -
Two types irregular labelling on dodecahedral modified generalization graph
by: Nurdin Hinding, et al.
Published: (2022-11-01)