University of IsfahanTransactions on Combinatorics2251-86578220190601On derivable trees21432357910.22108/toc.2019.113737.1601ENMohammad HamidiDept. of Math., Faculty of Mathematics, Payame Noor University,
Tehran, IranArsham Borumand SaeidDepartment of Pure Mathematics, Faculty of Mathematics and Computer, Shahid Bahonar University of Kerman, Kerman, IranJournal Article20181101This 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.http://toc.ui.ac.ir/article_23579_d76550a1832a5a27dd88153a59ea2645.pdf