پیوندهای مفید
اخبار و اعلانات
آمار
| تعداد نشریات | 158 |
| تعداد شماره‌ها | 6,225 |
| تعداد مقالات | 67,685 |
| تعداد مشاهده مقاله | 114,971,783 |
| تعداد دریافت فایل اصل مقاله | 89,643,147 |
$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 | ||
|
آمار تعداد مشاهده مقاله: 129 تعداد دریافت فایل اصل مقاله: 134 |
||