| تعداد نشریات | 32 |
| تعداد شمارهها | 607 |
| تعداد مقالات | 5,927 |
| تعداد مشاهده مقاله | 8,999,111 |
| تعداد دریافت فایل اصل مقاله | 6,577,482 |
Vertex Cover Number in Sierpi$\rm{\acute{n}}$ski-Like Networks | ||
| Caspian Journal of Mathematical Sciences | ||
| مقالات آماده انتشار، پذیرفته شده، انتشار آنلاین از تاریخ 01 آذر 1405 | ||
| نوع مقاله: Research Articles | ||
| شناسه دیجیتال (DOI): 10.22080/cjms.2026.32782.1922 | ||
| نویسندگان | ||
| ANITHA J* 1؛ Harish Raghavendar K2؛ Mostafa NouriJouybari3؛ Farshid Mofidnakhaei4 | ||
| 1Department of Mathematics, Rajalakshmi Institute of Technology, Chennai, India | ||
| 2Department of Electronics and Communication Engineering,\\PSG Institute of Technology and Applied Research Coimbatore-641 | ||
| 3Payame Noor University (PNU) Tehran- Iran | ||
| 4Department of Physics, Sar.C., Islamic Azad University, Sari, Iran | ||
| تاریخ دریافت: 28 مرداد 1405، تاریخ بازنگری: 29 شهریور 1405، تاریخ پذیرش: 29 شهریور 1405 | ||
| چکیده | ||
| A set $S$ of vertices in a graph $G$ satisfying the condition that each edge of $G$ has at least one end vertex in $S$ is called a \textit{vertex cover} of $G$. The minimal cardinality across all vertex covering sets of $G$ is the vertex covering number of $G$ and is denoted by $\beta(G)$. In order to guarantee balanced data gathering and reduce congestion in fractal networks, such as Sierpi$\rm{\acute{n}}$ski-like networks. We also use a simulation algorithm to determine the minimal vertex cover to place nodes as gateways or aggregators for local clusters in the fractal hierarchy. Additionally, the usefulness of the suggested strategy in enhancing network performance and reliability while preserving low operational overhead is demonstrated by simulation results and real-world use cases. | ||
| کلیدواژهها | ||
| Vertex covering؛ VLSI design؛ IoT؛ Simulation؛ Algorithm | ||
|
آمار تعداد مشاهده مقاله: 1 |
||