Results 21 to 30 of about 40,185 (227)
Super edge-magic labeling for π-uniform, complete π-uniform and complete π-uniform π-partite hypergraphs [PDF]
Songklanakarin Journal of Science and Technology (SJST), 2021 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
Characterizing the hypergraph-of-entity and the structural impact of its extensions
Applied Network Science, 2020 The hypergraph-of-entity is a joint representation model for terms, entities and their relations, used as an indexing approach in entity-oriented search.
JosΓ© Devezas, SΓ©rgio Nunes
doaj +1 more source
IEEE Access, 2023 With the increasingly competitive job market, the employment issue for college graduates has received more and more attention. Predicting graduation development can help students understand their suitable graduation development, thus easing the pressure ...
Yong Ouyang +4 more
doaj +1 more source
Hypergraph Contextuality [PDF]
Entropy, 2019 Quantum contextuality is a source of quantum computational power and a theoretical delimiter between classical and quantum structures. It has been substantiated by numerous experiments and prompted generation of state independent contextual sets, that is, sets of quantum observables capable of revealing quantum contextuality for any quantum state of a ...
openaire +4 more sources
, 2011 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
Infection in hypergraphs [PDF]
Discrete Applied Mathematics, 2018 In this paper a new parameter for hypergraphs called hypergraph infection is defined. This concept generalizes zero forcing in graphs to hypergraphs. The exact value of the infection number of complete and complete bipartite hypergraphs is determined. A formula for the infection number for interval hypergraphs and several families of cyclic hypergraphs
Ryan Bergen +8 more
openaire +2 more sources
Individual Differences in Dynamic Functional Brain Connectivity across the Human Lifespan. [PDF]
PLoS Computational Biology, 2016 Individual differences in brain functional networks may be related to complex personal identifiers, including health, age, and ability. Dynamic network theory has been used to identify properties of dynamic brain function from fMRI data, but the majority
Elizabeth N Davison +6 more
doaj +1 more source
Almost Self-Complementary Uniform Hypergraphs
Discussiones Mathematicae Graph Theory, 2018 A k-uniform hypergraph (k-hypergraph) is almost self-complementary if it is isomorphic with its complement in the complete k-uniform hypergraph minus one edge. We prove that an almost self-complementary k-hypergraph of order n exists if and only if (nk)$\
Wojda Adam PaweΕ
doaj +1 more source
IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, 2023 Cross-modal remote sensing (RS) image retrieval aims to retrieve RS images using other modalities (e.g., text) and vice versa. The relationship between objects in the RS image is complex, i.e., the distribution of multiple types of objects is uneven ...
Fanglong Yao +6 more
doaj +1 more source
The existence of bipartite almost self-complementary 3-uniform hypergraphs [PDF]
Opuscula Mathematica, 2023 An almost self-complementary 3-uniform hypergraph on \(n\) vertices exists if and only if \(n\) is congruent to 3 modulo 4 A hypergraph \(H\) with vertex set \(V\) and edge set \(E\) is called bipartite if \(V\) can be partitioned into two subsets \(V_1\
L.N. Kamble +2 more
doaj +1 more source