Computation of Total Vertex Irregularity Strength of Theta Graphs
A total labeling <inline-formula> <tex-math notation="LaTeX">$\phi: V(G)\cup E(G) \to \{1,2, {\dots }, k\}$ </tex-math></inline-formula> is called a <italic>vertex irregular total</italic> <inline-formula> <tex-math notation="LaTeX">...
Main Authors: | Ali N. A. Koam, Ali Ahmad |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2019-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8786105/ |
Similar Items
-
On total edge irregularity strength of centralized uniform theta graphs
by: Riyan Wicaksana Putra, et al.
Published: (2018-04-01) -
On Total Vertex Irregularity Strength of Cocktail Party Graph
by: Kristiana Wijaya, et al.
Published: (2011-07-01) -
Counterexamples to the total vertex irregularity strength’s conjectures
by: Faisal Susanto, et al.
Published: (2023-11-01) -
Computing The Irregularity Strength of Planar Graphs
by: Hong Yang, et al.
Published: (2018-08-01) -
Modular total vertex irregularity strength of graphs
by: Gohar Ali, et al.
Published: (2023-01-01)