A New Paradigm on Semihypergraph

Abstract

The generalization of connected hypergraph is a Semihypergraph (Hs). In graph theory, edge connects exactly two vertices. An edge containing two or more than two vertices is a hypergraph. The definition of a semihypergraph and its characteristics are discussed in this paper. The concept of semihypergraph deals with minimum of three vertices in order to satisfy the condition that it should have end vertex, middle vertex and middle end vertex. Some of its basic definitions like subsemihypergraph, degree, walk, path etc., has been discussed and compared with a real-life problem.