On derivable trees

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‎.

Keywords:

(Hyper)graph , derivable graphs , positive equivalence relation

Authors

Mohammad Hamidi

Dept. of Math., Faculty of Mathematics, Payame Noor University, Tehran, Iran

Arsham Borumand Saeid

Department of Pure Mathematics, Faculty of Mathematics and Computer, Shahid Bahonar University of Kerman, ‎Kerman, Iran‎

Certificate
من نویسنده این مقاله هستم

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این Paper:

https://civilica.com/doc/1194868

شناسه ملی سند علمی:

JR_COMB-8-2_003

تاریخ نمایه سازی: 14 اردیبهشت 1400

How to Cite to This Paper:

If you want to refer to this Paper in your research work, you can simply use the following phrase in the resources section:

Hamidi, Mohammad and Borumand Saeid, Arsham,1398,On derivable trees,https://civilica.com/doc/1194868

Scientometrics

The specifications of the publisher center of this Paper are as follows:

Ranking of Payame Noor University

Type of center: پیام نور

Paper count: 83,624

In the scientometrics section of CIVILICA, you can see the scientific ranking of the Iranian academic and research centers based on the statistics of indexed articles.