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: | , , , , , |
---|---|
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 |