آمار
| تعداد نشریات | 45 |
| تعداد شمارهها | 1,499 |
| تعداد مقالات | 18,323 |
| تعداد مشاهده مقاله | 59,471,472 |
| تعداد دریافت فایل اصل مقاله | 20,800,385 |
Isolated toughness and fractional (k; m)--covered graph | ||
| Computational Methods for Differential Equations | ||
| مقالات آماده انتشار، پذیرفته شده، انتشار آنلاین از تاریخ 15 خرداد 1405 اصل مقاله (1.01 M) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22034/cmde.2025.68002.3261 | ||
| نویسندگان | ||
| Wei Gao1؛ Carlo Cattani2؛ Armando Ciancio3؛ Haci Mehmet Baskonus* 4 | ||
| 1School of Mathematics, Hohai University, Nanjing 211100, China. | ||
| 2Engineering School (DEIM), University of Tuscia, Viterbo 01100, Italy. | ||
| 3Università degli Studi di Messina, Dipartimento di Scienze Biomediche, Odontoiatriche e delle Immagini Morfologiche e Funzionali, Messina, 98122, Italy. | ||
| 4Department of Mathematics and Science Education, Faculty of Education, Harran University, Sanliurfa 63159, Turkey. | ||
| چکیده | ||
| The fractional k-factor is a spanning subgraph determined by the support set of the fractional indicator function, which requires that the sum of the fractional indicator function values of the edges incident with each vertex is k, where k is a positive integer. A graph G is fractional (k; m)-covered if for any H ⊆ E(G) with jHj = m, there is a fractional factor with fractional indicator function h satisfying h(e) = 1 for any e 2 H. Isolated toughness is a pivotal indicator in network security and a prominent performance indicator that engineers considering during the network design phase. In this work, we present the isolated toughness and its variant bounds for fractional (k; m)-covered graphs, and the sharpness of given bounds are delineated by counterexamples. | ||
| کلیدواژهها | ||
| fractional factor؛ isolated toughness؛ fractional (k؛ m)-covered graph | ||
|
آمار تعداد مشاهده مقاله: 9 تعداد دریافت فایل اصل مقاله: 6 |
||