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...

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...

Misalkan adalah suatu graf dan bilangan bulat positif. Pelabelan- total pada pemetaan Bobot titik dinyatakan bobot sisi Suatu pelabelan- dikatakan tak teratur total, jika setiap berbeda berbeda. Nilai ketakteraturan (totally irregularity strength) dari dinotasikan dengan nilai minimum atau label terbesar yang digunakan untuk melabeli pelabelan-k total. Dalam makalah ini diperoleh 4 copy bintan ...

In this research paper, we present a novel frame work for handling $m$-polar information by combining the theory of $m-$polar fuzzy  sets with graphs. We introduce certain types of edge regular $m-$polar fuzzy graphs and edge irregular $m-$polar fuzzy graphs. We describe some useful properties of edge regular, strongly edge irregular and strongly edge totally irregular $m-$polar fuzzy graphs. W...

We consider only finite undirected graphs without loops or multiple edges. For terminology and notation not defined here we refer the reader to Bondy and Murty’s textbook [6]. In this note we investigate irregularity measures of graphs. A graph is regular if all its vertices have the same degree, otherwise it is irregular. However, it is of interest to measure how irregular it is. Several appro...