Results 91 to 100 of about 8,099 (222)
Series–parallel chromatic hypergraphs
, 2010 In this paper two-terminal series–parallel chromatic hypergraphs are introduced and for this class of hypergraphs it is shown that the chromatic polynomial can be computed with polynomial complexity.
Bokhary, Syed Ahtsham Ul Haq +1 more
core +1 more source
Modularity Definition and Optimization Algorithm for Community Detection in Signed Hypergraphs
ComplexityThe analysis of super-dyadic relations through hypergraphs is gradually gaining attention, with its community structure analysis playing a crucial role in computational social science.
Wei Du, Guangyu Li
doaj +1 more source
Single‐Cell and Spatial Omics: Methods and Applications
MedComm, Volume 7, Issue 4, April 2026.Systematically summarized the breakthrough sequencing technologies and computational methods for single‐cell and spatial omics across multiple omics layers, including genome, epigenome, transcriptome, proteome, and metabolome. State‐of‐the‐art methods for multi‐omics integration, cross‐modal integration, and cross‐scale integration were reviewed, with ...
Xiaoping Cen +10 more
wiley +1 more source
European Journal of Combinatorics, 2001 Formulas for the cycle index of the representation of the symmetric group of degree \(n\) acting on all subsets of the object set are derived and applied through \(n=7\). These can be used to enumerate hypergraphs with Pólya's enumeration theorem. The approach is similar to that of \textit{E. M. Palmer} [Discrete Math. 6, 377-390 (1973; Zbl 0269.05110)]
openaire +2 more sources
Discrete Mathematics, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Barry Guiduli, Zoltán Király
openaire +2 more sources
Physical Review E, 2023 Providing an abstract representation of natural and human complex structures is a challenging problem. Accounting for the system heterogenous components while allowing for analytical tractability is a difficult balance. Here I introduce complex hypergraphs (chygraphs), bringing together concepts from hypergraphs, multi-layer networks, simplicial ...
openaire +3 more sources
, 2018 In this paper we consider two natural notions of connectivity for hypergraphs: weak and strong. We prove that the strong vertex connectivity of a connected hypergraph is bounded by its weak edge connectivity, thereby extending a theorem of Whitney from ...
Megan Dewar, David Pike, John Proos
core +1 more source
Constructing cospectral hypergraphs [PDF]
Spectral hypergraph theory mainly concerns using hypergraph spectra to obtain structural information about the given hypergraphs. The study of cospectral hypergraphs is important since it reveals which hypergraph properties cannot be deduced from their ...
Abiad, Aida, Khramova, Antonina P.
core +2 more sources
The upper chromatic number of quasi-interval co-hypergraphs
Le Matematiche, 1997 We investigate the structural and colouring properties of clique hyper-graphs of interval graphs called the quasi-interval hypergraphs. We find the conditions when they are interval hypergraphs. The upper chromatic number for the clique co-hypergraphs of
Violeta Prisakaru
doaj
Analysis of hub parameters in fuzzy hypergraphs extending to intuitionistic fuzzy threshold hypergraphs: Applications in designing transport networks in amusement parks using hub hyperpaths [PDF]
Notes on IFSA hypergraph is a generalization of a graph where an edge can connect any number of vertices. In this paper, many different aspects of fuzzy hypergraphs and their applications are examined.
K. K. Myithili, C. Nandhini
doaj +1 more source