What type of study is this?

Total Edge Irregularity Strength of Graph L₃⊙Nₘ

View Full Paper

Ask AI

Bookmark

Authors

Analysis reveals distinct edge weights in the corona product of ladder and null graphs, suggesting implications for graph labeling theory.

Distinct edge weights were achieved in the corona product of a ladder graph and a null graph.
The minimum integer required for labeling is identified as the total edge irregularity strength.
Constructive labeling methods were applied to analyze edge weight assignments.
Results provide insights into applications in cryptography and network security.

Nikita et al. (2025) studied this question.

View Full Paper

Ask AI

Bookmark

Analysis reveals distinct edge weights in the corona product of ladder and null graphs, suggesting implications for graph labeling theory.