Results 151 to 160 of about 56,011 (266)

Hypergraphes de Petersen! Hypergraphes de Moore?

Discrete Mathematics, 1993
RésuméOn étudie ici des sous structures des plan projectifs finis Pg(2,n) oú n est impair. Dans ceux-ci les (n + 1)-arcs induisent une décomposition canonique.Soit E l'ensemble des points, D celui des droites, appelons X l'ensemble des points d'un (n+1)-arc.
openaire   +1 more source

On the general sum-connectivity index of hypergraphs

AIMS Mathematics
Given a non-zero real number $ \alpha $, the general sum-connectivity index $ \chi_{\alpha} $ for graph $ G $ is given by the sum $ \Sigma_{xy\in {E(G)}} (d_x+d_y)^{\alpha} $. Here, $ d_x $ denotes the degree of a vertex $ x $ in graph $ G $, and $ E(G) $
Hongzhuan Wang, Piaoyang Yin, Yan Li
doaj   +1 more source

Only the source’s and sink’s neighborhood matters: convergence results for unicast and multicast connections on random graphs and hypergraphs. [PDF]

, 2014
Muriel Médard, Jérôme Casse
openalex   +1 more source

Algorithmic Number On the Forehead Protocols Yielding Dense Ruzsa-Szemerédi Graphs and Hypergraphs [PDF]

, 2020
Noga Alon, Adi Shraibman
openalex   +1 more source

Entropy-based models to randomise real-world hypergraphs

Communications Physics
Network theory has often disregarded many-body relationships, solely focusing on pairwise interactions: neglecting them, however, can lead to misleading representations of complex systems.
Fabio Saracco, Giovanni Petri, Renaud Lambiotte, Tiziano Squartini   +3 more
doaj   +1 more source

Extending Graph-Based LP Techniques for Enhanced Insights Into Complex Hypergraph Networks

IEEE Access
Many real-world problems can be modelled in the form of complex networks. Social networks such as research collaboration networks and facebook, biological neural networks such as human brains, biomedical networks such as drug-target interactions and ...
Y. V. Nandini, T. Jaya Lakshmi, Murali Krishna Enduri, Hemlata Sharma, Mohd Wazih Ahmad   +4 more
doaj   +1 more source

Hypergraphical t-designs

Discrete Mathematics, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

The convex dimension of hypergraphs and the hypersimplicial Van\n Kampen-Flores Theorem [PDF]

, 2019
Leonardo Martínez-Sandoval, Arnau Padrol   +1 more
openalex   +1 more source

Hypercurveball algorithm for sampling hypergraphs with fixed degrees [PDF]

Yanna J. Kraakman, Clara Stegehuis
openalex   +1 more source

Hypergraph Isomorphism Computation

IEEE Transactions on Pattern Analysis and Machine Intelligence
The isomorphism problem is a fundamental problem in network analysis, which involves capturing both low-order and high-order structural information. In terms of extracting low-order structural information, graph isomorphism algorithms analyze the structural equivalence to reduce the solver space dimension, which demonstrates its power in many ...
Yifan Feng, Jiashu Han, Shihui Ying, Yue Gao   +3 more
openaire   +3 more sources