Results 61 to 70 of about 538 (183)
Orientations of Graphs With at Most One Directed Path Between Every Pair of Vertices
Journal of Graph Theory, Volume 113, Issue 1, Page 143-164, September 2026.ABSTRACT Given a graph G, we say that an orientation D of G is a KT orientation if, for all u , v ∈ V ( D ), there is at most one directed path (in any direction) between u and v. Graphs that admit such orientations have been used to construct graphs with large chromatic number and small clique number that served as counterexamples to various ...
Barbora Dohnalová +3 more
wiley +1 more source
Land Degradation &Development, Volume 37, Issue 15, Page 10672-10696, September 2026.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
Transversals and domination in uniform hypergraphs
European Journal of Combinatorics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Csilla Bujtás +2 more
openaire +3 more sources
An Extended Formulation With Valid Inequalities for the Capacitated Steiner Arborescence Problem
Networks, Volume 88, Issue 2, Page 250-274, September 2026.ABSTRACT Given a directed graph, the Capacitated Steiner Arborescence Problem (CSAP) aims to determine the least‐cost connection from the root node to terminal nodes requiring a demand through Steiner nodes coming with a capacity, such that there is a unique path from the root to each terminal. This paper presents a new extended formulation of the CSAP,
Francesco Contu +3 more
wiley +1 more source
Quantitative Biology, Volume 14, Issue 3, September 2026.Abstract Single‐cell RNA sequencing (scRNA‐seq) has transformed the study of cellular heterogeneity by making it possible to classify individual cells and their functional states. However, the analysis remains difficult because high dropout rates lead to sparse and noisy expression data.
Shahriar Rahman Niloy +5 more
wiley +1 more source
Construction of S(3) (2, 3)-Designs of Any Index
MathematicsLet H(3) be a uniform hypergraph of rank 3. A hyperstar S(3)(2,3) of centre C={x,y} is a 3-uniform hypergraph with three hyperedges, all having the centre C={x,y} in common, with x and y of degree 3 and the remaining vertices of degree 1.
Antonio Causa +2 more
doaj +1 more source
Topological, Compositional, and Dynamic Information in Chemical Reaction Systems
ChemSystemsChem, Volume 8, Issue 5, September 2026.Chemical reaction systems transform and organize information encoded in molecular structure, composition and environmental inputs. Reaction topology constrains how information propagates through a network, shaping both compositional outcomes and dynamic responses.
William E. Robinson
wiley +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
A note on a list colouring of hypergraphs [PDF]
Opuscula Mathematica, 2004 In the note we present two results. The first of them gives a sufficient condition for a colouring of a hypergraph from an assigned list. It generalises the analogous fact for graphs.
Ewa Drgas-Burchardt
doaj
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