پیوندهای مفید
اخبار و اعلانات
آمار
| تعداد نشریات | 158 |
| تعداد شماره‌ها | 6,240 |
| تعداد مقالات | 67,871 |
| تعداد مشاهده مقاله | 115,433,131 |
| تعداد دریافت فایل اصل مقاله | 90,201,842 |
A Survey on Tenacity Parameter\\Part II | ||
| Journal of Algorithms and Computation | ||
| دوره 54، شماره 1، شهریور 2022، صفحه 47-72 اصل مقاله (389.4 K) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22059/jac.2022.88027 | ||
| نویسندگان | ||
| Dara Moazzami* 1؛ Asieh Khoshnood2 | ||
| 1University of Tehran, College of Engineering, Faculty of Engineering Science. | ||
| 2University of Tehran Department of Algorihthms and Computation, Tehran, Iran | ||
| چکیده | ||
| In this paper, we study the edge tenacity of graphs. We will be primarily interested in edge-tenacious graphs, which can be considered very stable and are somewhat analogous in edge tenacity to honest graphs in edge-integrity. We show several results about edge-tenacious graphs as well as find numerous classes of edge-tenacious graphs. The Cartesian Products of graphs like hypercube, grids, and tori are widely used to design interconnection networks in multiprocessor computing systems. These considerations motivated us to study tenacity of Cartesian products of graphs. We find the tenacity of Cartesian product of complete graphs (thus setting a conjecture stated in Cozzens and al.) and grids. The Middle Graph, M(G) of a graph G is the graph obtained from G by inserting a new vertex into every edge of G and by joining by edges those pairs of these new vertices which lie on adjacent edges of G | ||
| کلیدواژه‌ها | ||
| edge-tenacious؛ Cartesian products؛ Middle Graph؛ connectivity؛ binding number؛ toughness؛ maximum graphical structure | ||
|
آمار تعداد مشاهده مقاله: 135 تعداد دریافت فایل اصل مقاله: 174 |
||