Application of Superhypergraphs-Based Domination Number in Real World

M. Hamidi · M. Taghinezhad

2023년 1월 · HyperSoft Set 28권 · Infinite Study

eBook

페이지

적용 가능

검증되지 않은 평점과 리뷰입니다. 자세히 알아보기

eBook 정보

The concept of (quasi) superhypergraphs as a generalization of graphs makes a relation between some sets of elements in detail and in general (in the form of parts to parts, parts to whole, and whole to whole elements of sets) and is very useful in the real world. This paper considers the novel concept of (quasi) superhypergraphs and introduces the notation of dominating set and domination number of (quasi) super-hypergraphs. Especially, we have analyzed the domination number of uniform (quasi) superhypergraphs and computed their domination number on different cases. The ows (from right to left, from left to right, and two-sided) as maps play a main role in (quasi) superhypergraphs and it is proved that domination numbers of (quasi) superhypergraphs are dependent on the ows. We define the valued-star (quasi) superhyper-graphs for the design of hypernetworks and compute their domination numbers. We have shown that the domination numbers of valued-star (quasi) superhypergraphs are distinct in different ow states. In final, we introduce some applications of dominating sets of (quasi) superhyper-graphs in hypernetwork as computer networks and treatment networks with the optimal application.