Results 61 to 70 of about 41,298 (230)
The Largest Laplacian and Signless Laplacian H-Eigenvalues of a Uniform Hypergraph [PDF]
, 2013 In this paper, we show that the largest Laplacian H-eigenvalue of a $k$-uniform nontrivial hypergraph is strictly larger than the maximum degree when $k$ is even. A tight lower bound for this eigenvalue is given.
Hu, Shenglong, Qi, Liqun, Xie, Jinshan
core
On the spectrum of hypergraphs
, 2016 Here we study the spectral properties of an underlying weighted graph of a non-uniform hypergraph by introducing different connectivity matrices, such as adjacency, Laplacian and normalized Laplacian matrices. We show that different structural properties
Chris Ritchie (1952305) +4 more
core +3 more sources
A Vulnerability Lens for Intuitive‐Logic Scenarios
FUTURES &FORESIGHT SCIENCE, Volume 8, Issue 1, April 2026.ABSTRACT Exploration of possibilities by means of intuitive logic is hampered by a large number of scenarios, which easily exceed the limits imposed by human bounded rationality. While many practitioners constrain their scenarios within a 2 × 2 $2\times 2$ matrix by design, more structured approaches point to rationales such as eliminating ...
Guido Fioretti
wiley +1 more source
Semisupervised Hypergraph Discriminant Learning for Dimensionality Reduction of Hyperspectral Image
IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, 2020 Semisupervised learning is an effective technique to represent the intrinsic features of a hyperspectral image (HSI), which can reduce the cost to obtain the labeled information of samples.
Fulin Luo +4 more
doaj +1 more source
Decompositions of complete 3-uniform hypergraphs into cycles of constant prime length [PDF]
Opuscula Mathematica, 2020 A complete \(3\)-uniform hypergraph of order \(n\) has vertex set \(V\) with \(|V|=n\) and the set of all \(3\)-subsets of \(V\) as its edge set. A \(t\)-cycle in this hypergraph is \(v_1, e_1, v_2, e_2,\dots, v_t, e_t, v_1\) where \(v_1, v_2,\dots, v_t\)
R. Lakshmi, T. Poovaragavan
doaj +1 more source
, 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
Large language models for bioinformatics
Quantitative Biology, Volume 14, Issue 1, March 2026.Abstract With the rapid advancements in large language model technology and the emergence of bioinformatics‐specific language models (BioLMs), there is a growing need for a comprehensive analysis of the current landscape, computational characteristics, and diverse applications.
Wei Ruan +54 more
wiley +1 more source
Computer Science Journal of Moldova, 1993 We introduce the notion of an anti-edge of a hypergraph, which is a non-overall polychromatic subset of vertices. The maximal number of colors, for which there exists a coloring of a hypergraph using all colors, is called an upper chromatic number of a ...
V. Voloshin
doaj
A comprehensive review of cluster methods for drug–drug interaction network
Quantitative Biology, Volume 14, Issue 1, March 2026.Abstract The detection of drug–drug interaction (DDI) is crucial to the rational use of drug combinations. Experimentally, DDI detection is time‐consuming and laborious. Currently, researchers have developed a variety of computational methods to predict DDI.
Shuyuan Cao +3 more
wiley +1 more source
Multiview Hypergraph Fusion Network for Change Detection in High-Resolution Remote Sensing Images
IEEE Journal of Selected Topics in Applied Earth Observations and Remote SensingCurrently, convolutional neural networks and transformers have been the dominant paradigms for change detection (CD) thanks to their powerful local and global feature extraction capabilities. However, with the improvement of resolution, spatial, spectral,
Xue Zhao +5 more
doaj +1 more source