Modular Irregularity Strength of Triangular Book Graph
Abstract
This paper deals with the modular irregularity strength of a graph of n vertices, a new graph invariant, modified from the irregularity strength, by changing the condition of the vertex-weight set associate to the well-known irregular labeling from n distinct positive integer to Zn-the group of integer modulo n. Investigating the triangular book graph Bm((3)), we first find the irregularity strength of triangular book graph s(Bm((3)) ), as the lower bound for the modular irregularity strength, and then construct a modular irregular s(Bm((3)) )-labeling. The result shows that triangular book graphs admit a modular irregular labeling and its modular irregularity strength and irregularity strength are equal, except for a small case and the infinity property.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.