On derivable trees
Publish place: Transactions on Combinatorics، Vol: 8، Issue: 2
Publish Year: 1398
نوع سند: مقاله ژورنالی
زبان: English
View: 264
This Paper With 23 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_COMB-8-2_003
تاریخ نمایه سازی: 14 اردیبهشت 1400
Abstract:
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:
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