Results 11 to 20 of about 10,205 (230)
Super edge-magic labeling for π-uniform, complete π-uniform and complete π-uniform π-partite hypergraphs [PDF]
Let π» be a hypergraph with a vertex set π and a hyperedge set πΈ. Generalized from the super edge-magic in a graph, we say that a hypergraph π» is super edge-magic if there is a bijection π: π βͺ πΈ β {1,2,3, β¦ , |π| + |πΈ|} which satisfies: (i) there exists
Ratinan Boonklurb +2 more
doaj +1 more source
This article presents an extension of the study of metric and partition dimension to hypergraphs. We give sharp lower bounds for the metric and partition dimension of hypergraphs in general and give exact values under specified conditions.
Imran Javaid +3 more
openaire +3 more sources
This open access book discusses the theory and methods of hypergraph computation. Many underlying relationships among data can be represented using graphs, for example in the areas including computer vision, molecular chemistry, molecular biology, etc ...
Gao, Yue, Dai, Qionghai
core +1 more source
The treewidth of 2-section of hypergraphs [PDF]
Let $H=(V,F)$ be a simple hypergraph without loops. $H$ is called linear if $|f\cap g|\le 1$ for any $f,g\in F$ with $f\not=g$. The $2$-section of $H$, denoted by $[H]_2$, is a graph with $V([H]_2)=V$ and for any $ u,v\in V([H]_2)$, $uv\in E([H]_2)$ if ...
Ke Liu, Mei Lu
doaj +1 more source
Automatic Software Module Partition Based on Hypergraph Model [PDF]
This paper applies the hypergraph model to design automatic software module partition algorithm.Under the hypergraph modeling,each significant class extracted from the source codes of an analyzing software system is abstracted as a vertex of a hypergraph,
WEI Xiaofeng,HU Jicheng,LUO Yongβen
doaj +1 more source
Multi-site Hyper-graph Convolutional Neural Networks and Application [PDF]
Recently,the exploitation of graph neural networks for neurological brain disorder diagnosis has attracted much attention.However,the graphs used in the existing studies are usually based on the pairwise connections of different nodes,and thus cannot ...
ZHOU Hai-yu, ZHANG Dao-qiang
doaj +1 more source
A support of a hypergraph H is a graph with the same vertex set as H in which each hyperedge induces a connected subgraph. We show how to test in polynomial time whether a given hypergraph has a cactus support, i.e. a support that is a tree of edges and cycles.
Brandes, Ulrik +3 more
openaire +3 more sources
The k-annihilating-ideal hypergraph of commutative ring
The concept of the annihilating-ideal graph of a commutative ring was introduced by Behboodi et. al in 2011. In this paper, we extend this concept to the hypergraph for which we define an algebraic structure called k-annihilating-ideal of a commutative ...
K. Selvakumar, V. Ramanathan
doaj +2 more sources
Multi-order hypergraph convolutional networks integrated with self-supervised learning
Hypergraphs, as a powerful representation of information, effectively and naturally depict complex and non-pair-wise relationships in the real world. Hypergraph representation learning is useful for exploring complex relationships implicit in hypergraphs.
Jiahao Huang +5 more
doaj +1 more source
Complexity science provides a powerful framework for understanding physical, biological and social systems, and network analysis is one of its principal tools. Since many complex systems exhibit multilateral interactions that change over time, in recent years, network scientists have become increasingly interested in modelling and ...
Corinna Coupette +2 more
openaire +3 more sources

