In this paper, we introduce certain concepts, including neutrosophic hypergraph, line graph of neutrosophic hypergraph, dual neutrosophic hypergraph, tempered neutrosophic hypergraph and transversal neutrosophic hypergraph. We illustrate these concepts by several examples and investigate some of interesting properties. Key-words: Neutrosophic hypergraph, Line graph of neutrosophic hypergraph, D...

this paper continues the investigation of the rst author begun in part one. the hereditary properties of n-homomorphism amenability for banach algebras are investigated and the relations between n-homomorphism amenability of a banach algebra and its ide- als are found. analogous to the character amenability, it is shown that the tensor product of two unital banach algebras is n-homomorphism am...

Abstract This chapter introduces three hypergraph computation paradigms, including intra-hypergraph computation, inter-hypergraph and structure computation. Intra-hypergraph representation aims to conduct learning of a hypergraph, where each subject is represented by its components. Inter-hypergraph vertices in the vertex hypergraph. Hypergraph prediction, which find connections among vertices....

In this paper, the concept of hypergraph is extended to the fuzzy hypergraph. In the fuzzy hypergraph, the concepts of a-cut hypergraph, strength of edge and dual fuzzy hypergraph are developed. It is shown that the fuzzy hypergraph and a-cut hypergraph are useful to represent a fuzzy partition. An application example also shows that the strength of edge can be used to decompose the data set in...

We show that certain canonical realizations of the complexes Hom(G,H) and Hom+(G,H) of (partial) graph homomorphisms studied by Babson and Kozlov are in fact instances of the polyhedral Cayley trick. For G a complete graph, we then characterize when a canonical projection of these complexes is itself again a complex, and exhibit several well-known objects that arise as cells or subcomplexes of ...

Abstract Hypergraph modeling is the fundamental task in hypergraph computation, which targets on establishing a high-quality structure to accurately formulate high-order correlation among data. In this section, we introduce different methods show how build hypergraphs using various pieces of information, such as features, attributes, and/or graphs. These are organized into two broad categories,...

...