پیوندهای مفید
اخبار و اعلانات
آمار
| تعداد نشریات | 43 |
| تعداد شماره‌ها | 1,706 |
| تعداد مقالات | 13,973 |
| تعداد مشاهده مقاله | 33,609,258 |
| تعداد دریافت فایل اصل مقاله | 13,329,092 |
On derivable trees | ||
| Transactions on Combinatorics | ||
| مقاله 3، دوره 8، شماره 2، شهریور 2019، صفحه 21-43 اصل مقاله (309.3 K) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22108/toc.2019.113737.1601 | ||
| نویسندگان | ||
| Mohammad Hamidi1؛ Arsham Borumand Saeid* 2 | ||
| 1Dept. of Math., Faculty of Mathematics, Payame Noor University, Tehran, Iran | ||
| 2Department of Pure Mathematics, Faculty of Mathematics and Computer, Shahid Bahonar University of Kerman, Kerman, Iran | ||
| چکیده | ||
| This paper defines the concept of partitioned hypergraphs, and enumerates the number of these hypergraphs and discrete complete hypergraphs. A positive equivalence relation is defined on hypergraphs, this relation establishes a connection between hypergraphs and graphs. Moreover, we define the concept of (extended) derivable graph. Then a connection between hypergraphs and (extended) derivable graphs was investigated. Via the positive equivalence relation on hypergraphs, we show that some special trees are derivable graph and complete graphs are self derivable graphs. | ||
| کلیدواژه‌ها | ||
| (Hyper)graph؛ derivable graphs؛ positive equivalence relation | ||
|
آمار تعداد مشاهده مقاله: 481 تعداد دریافت فایل اصل مقاله: 336 |
||