Let G = (V;E) be a graph. A total labeling ψ : V ⋃ E → {1, 2, ....k} is called totally irregular k-labeling of if every two distinct vertices u and v in (G) satisfy wt(u) ≠wt(v); edges u1u2 v1v2 E(G) wt(u1u2) ≠ wt(v1v2); where (u) + ∑uv∊E(G) ψ(uv) ψ(u1) ψ(u1u2) ψ(u2): The minimum k for which graph has the irregularity strength G, denoted by ts(G): In this paper, we determine exact value cubic g...

Let G(V, E) be a graph with order n no component of 2. An edge k-labeling α: E(G) →{1,2,…,k} is called modular irregular G if the corresponding weight function wt_ α:V(G) → Z_n defined by α(x) =Ʃ_(xyϵE(G)) α(xy) bijective. The value wt_α(x) vertex x. Minimum k such that has irregularity strength G. In this paper, we define labeling on C_n⊙mK_1. Furthermore, determine C_n⊙mK_1.Keywords: corona p...

Consider a simple graph $G$. We call labeling $w:E(G)\cup V(G)\rightarrow \{1, 2, \dots, s\}$ (\textit{total vertex}) \textit{product-irregular}, if all product degrees $pd_G(v)$ induced by this are distinct, where $pd_G(v)=w(v)\times\prod_{e\ni v}w(e)$. The strength of $w$ is $s$, the maximum number used to label members $E(G)\cup V(G)$. minimum value $s$ that allows some irregular called \tex...

Despite abundant research on the distribution of glottal stops and glottalization in English and other languages, it is still unclear which factors matter most in predicting where glottal stops occur. In this study, logistic mixed-effects regression modeling is used to predict the occurrence of word-initial full glottal stops vs. no voicing irregularity. The results indicate that prominence and...