Results 101 to 110 of about 1,981 (215)
On ABC spectral radius of uniform hypergraphs [PDF]
, 2023 Given a $k$-uniform hypergraph $G$ with vertex set $[n]$ and edge set $E(G)$, the ABC tensor $\mathcal{ABC}(G)$ of $G$ is the $k$-order $n$-dimensional tensor with \[ \mathcal{ABC}(G)_{i_1, \dots, i_k}= \begin{cases} \dfrac{1}{(k-1)!}\sqrt[k ...
Zhou, Bo, Lin, Hongying
core +1 more source
Partial Total Domination in Hypergraphs
MathematicsThis paper establishes fundamental results for partial total domination in hypergraphs. We present tight bounds for the partial total domination number in k-uniform hypergraphs, demonstrate relationships with classical domination parameters, and provide ...
Abdulkafi Sanad, Chaoqian Li
doaj +1 more source
Almost Self-Complementary 3-Uniform Hypergraphs
Discussiones Mathematicae Graph Theory, 2017 It is known that self-complementary 3-uniform hypergraphs on n vertices exist if and only if n is congruent to 0, 1 or 2 modulo 4. In this paper we define an almost self-complementary 3-uniform hypergraph on n vertices and prove that it exists if and ...
Kamble Lata N. +2 more
doaj +1 more source
Leveraging Artificial Intelligence and Large Language Models for Cancer Immunotherapy
Advanced Science, Volume 13, Issue 35, 24 June 2026.Cancer immunotherapy faces challenges in predicting treatment responses and understanding resistance mechanisms. Artificial intelligence (AI) and machine learning (ML) offer powerful solutions for cancer immunotherapy in patient stratification, biomarker discovery, treatment strategy optimization, and foundation model development.
Xinchao Wu +4 more
wiley +1 more source
On judicious partitions of uniform hypergraphs
Journal of Combinatorial Theory, Series A, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jianfeng Hou, Shufei Wu, Guiying Yan
openaire +1 more source
Human Brain Mapping, Volume 47, Issue 8, June 1, 2026.We propose MSSM+, an extension of multiscale structural mapping (MSSM), together with surface supervertex mapping (SSVM) and a Supervertex Vision Transformer (SV‐ViT). Together, these methods exhibited better performance in detecting Alzheimer's disease and less variability across MR vendors than MSSM.
Geonwoo Baek +3 more
wiley +1 more source
Transversals in 4-uniform linear hypergraphs [PDF]
, 2021 Let H be a hypergraph of order nH= |V(/H)| and size mH= |E(H)|. The transversal number τ (H) of a hypergraph H is the minimum number of vertices that intersect every edge of H.
Yeo, Anders; id_orcid +1 more
core +2 more sources
Two‐Round Ramsey Games on Random Graphs
Random Structures &Algorithms, Volume 68, Issue 3, May 2026.ABSTRACT Motivated by the investigation of sharpness of thresholds for Ramsey properties in random graphs, Friedgut, Kohayakawa, Rödl, Ruciński and Tetali introduced two variants of a single‐player game whose goal is to colour the edges of a random graph, in an online fashion, so as not to create a monochromatic triangle.
Yahav Alon +2 more
wiley +1 more source
Independence in 5-uniform hypergraphs
Discrete Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alex Eustis +2 more
openaire +2 more sources
Analytic methods for uniform hypergraphs [PDF]
, 2014 This paper presents some analytic methods for studying uniform hypergraphs. Its starting point is the spectral theory of 2-graphs, in particular, the largest and the smallest eigenvalues λ and λmin of 2-graphs. First, these two parameters are extended to
Nikiforov, Vladimir
core +1 more source