Results 71 to 80 of about 14,067 (220)
Equivalent Formulation of Thomassen's Conjecture Using Tutte Paths in Claw‐Free Graphs
ABSTRACT We continue studying Thomassen's conjecture (every 4‐connected line graph has a Hamilton cycle) in the direction of a recently shown equivalence with Jackson's conjecture (every 2‐connected claw‐free graph has a Tutte cycle), and we extend the equivalent formulation as follows: In every connected claw‐free graph, any two vertices are connected
Adam Kabela +2 more
wiley +1 more source
Semisupervised Hypergraph Discriminant Learning for Dimensionality Reduction of Hyperspectral Image
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
The signless Laplacian matrix of hypergraphs
In this article, we define signless Laplacian matrix of a hypergraph and obtain structural properties from its eigenvalues. We generalize several known results for graphs, relating the spectrum of this matrix to structural parameters of the hypergraph ...
Cardoso Kauê, Trevisan Vilmar
doaj +1 more source
Hypergraph-based connectivity measures for signaling pathway topologies
Characterizing cellular responses to different extrinsic signals is an active area of research, and curated pathway databases describe these complex signaling reactions.
T. M. Murali (7548488) +7 more
core +1 more source
Multiview Hypergraph Fusion Network for Change Detection in High-Resolution Remote Sensing Images
Currently, 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
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
In this paper, we prove that for any $k\ge 3$, there exist infinitely many minimal asymmetric $k$-uniform hypergraphs. This is in a striking contrast to $k=2$, where it has been proved recently that there are exactly $18$ minimal asymmetric graphs. We also determine, for every $k\ge 1$, the minimum size of an asymmetric $k$-uniform hypergraph.
Jiang, Yiting, Nešetřil, Jaroslav
openaire +2 more sources
Abstract Purpose To systematically evaluate the performance, methodological quality, and translational barriers of deep learning (DL) models for predicting knee osteoarthritis (KOA) progression from medical imaging. Methods Following PRISMA guidelines, we searched PubMed, Scopus, and Web of Science (inception to June 2026) for peer‐reviewed studies ...
Amna Gillani +5 more
wiley +1 more source
Generalizing the notion of split graphs to uniform hypergraphs, we prove that the class of these hypergraphs can be characterized by a finite list of excluded induced subhypergraphs. We show that a characterization by generalized degree sequences is impossible, unlike in the well-known case of split graphs. We also give an algorithm to decide whether a
openaire +2 more sources
ABSTRACT The use of Land Use Land Cover (LULC) analysis is a fundamental requirement for urban solid waste management (SWM); however, conventional LULC analysis methods are not well suited to the spatio‐temporal variability, multi‐sensor heterogeneity, and seasonal variations of highly dynamic urban environments.
Rubeena Vohra, Ashish Kumar
wiley +1 more source

