|
|
|
|
On derivable trees
|
|
|
|
|
|
|
|
نویسنده
|
hamidi mohammad ,broumand saeid arsham
|
|
منبع
|
transactions on combinatorics - 2019 - دوره : 8 - شماره : 2 - صفحه:21 -43
|
|
چکیده
|
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.
|
|
آدرس
|
university of payame noor, department of mathematics, Iran, shahid bahonar university of kerman, faculty of mathematics and computer, department of pure mathematics, Iran
|
|
پست الکترونیکی
|
arsham@uk.ac.ir
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|