میز خدمت الکترونیک
دوره ویراستاری

  اخبار و اعلانات

 آمار

تعداد نشریات126
تعداد شماره‌ها7,108
تعداد مقالات76,338
تعداد مشاهده مقاله152,251,643
تعداد دریافت فایل اصل مقاله114,230,016
Ponraj, R, SUBBULAKSHMI, S, Somasundaram, S. (1401). $4$-total mean cordial labeling of union of some graphs with the complete bipartite graph $K_{2,n}$. , 54(1), 35-46. doi: 10.22059/jac.2022.88026
R Ponraj; S SUBBULAKSHMI; S Somasundaram. "$4$-total mean cordial labeling of union of some graphs with the complete bipartite graph $K_{2,n}$". , 54, 1, 1401, 35-46. doi: 10.22059/jac.2022.88026
Ponraj, R, SUBBULAKSHMI, S, Somasundaram, S. (1401). '$4$-total mean cordial labeling of union of some graphs with the complete bipartite graph $K_{2,n}$', , 54(1), pp. 35-46. doi: 10.22059/jac.2022.88026
Ponraj, R, SUBBULAKSHMI, S, Somasundaram, S. $4$-total mean cordial labeling of union of some graphs with the complete bipartite graph $K_{2,n}$. , 1401; 54(1): 35-46. doi: 10.22059/jac.2022.88026

$4$-total mean cordial labeling of union of some graphs with the complete bipartite graph $K_{2,n}$

Journal of Algorithms and Computation
دوره 54، شماره 1، شهریور 2022، صفحه 35-46    اصل مقاله (296.58 K)
شناسه دیجیتال (DOI): 10.22059/jac.2022.88026
نویسندگان
R Ponraj* 1؛ S SUBBULAKSHMI2؛ S Somasundaram3
1Department of Mathematics Sri Parakalyani College Alwarkurichi -627 412, India
2Sri Paramakalyani College Alwarkurichi-627412, Tamilnadu, India
3Department of Mathematics Manonmaniam sundarnar university, Abishekapatti, Tirunelveli-627012, Tamilnadu, India
چکیده
Let $G$ be a graph. Let $f:V\left(G\right)\rightarrow \left\{0,1,2,\ldots,k-1\right\}$ be a function where $k\in \mathbb{N}$ and $k>1$. For each edge $uv$, assign the label $f\left(uv\right)=\left\lceil \frac{f\left(u\right)+f\left(v\right)}{2}\right\rceil$. $f$ is called $k$-total mean cordial labeling of $G$ if $\left|t_{mf}\left(i\right)-t_{mf}\left(j\right) \right| \leq 1$, for all $i,j\in\left\{0,1,2,\ldots,k-1\right\}$, where $t_{mf}\left(x\right)$ denotes the total number of vertices and edges labelled with $x$, $x\in\left\{0,1,2,\ldots,k-1\right\}$. A graph with admit a $k$-total mean cordial labeling is called $k$-total mean cordial graph. In this paper, we investigate the $4$-total mean cordial labeling of some graphs derived from the complete bipartite graph $K_{2,n}$.
کلیدواژه‌ها
path؛ cycle؛ complete graph؛ star؛ bistar؛ fan؛ wheel؛ helm and ladder
آمار
تعداد مشاهده مقاله: 318
تعداد دریافت فایل اصل مقاله: 395





سامانه مدیریت نشریات علمی. قدرت گرفته از سیناوب