Results 91 to 100 of about 1,265 (189)
Journal of Combinatorial Designs, Volume 34, Issue 7, Page 306-329, July 2026.ABSTRACT In this paper, we study and characterise the natural embedding of the twisted triality hexagon T ( q 3 , q ) in PG ( 7 , q 3 ). We begin by describing the possible intersections of subspaces of PG ( 7 , q 3 ) with T ( q 3 , q ). Then, we provide conditions on a set of lines ℒ, which ensure that ℒ forms the line set of a naturally embedded ...
Sebastian Petit, Geertrui Van de Voorde
wiley +1 more source
Disjoint Total Dominating Sets in Planar Graphs
Journal of Graph Theory, Volume 112, Issue 3, Page 290-295, July 2026.ABSTRACT The vertex set of any planar graph of minimum degree at least 3 can be colored in two colors so that every vertex has a neighbor of each color. If the graph is a planar triangulation, the coloring can be chosen such that every vertex has a neighbor of its own color and at least two neighbors of the opposite color.
Eva Rotenberg +2 more
wiley +1 more source
Treewidth Versus Clique Number. V. Further Connections With Tree‐Independence Number
Journal of Graph Theory, Volume 112, Issue 3, Page 337-351, July 2026.ABSTRACT We continue the study of ( tw , ω )‐bounded graph classes, that is, hereditary graph classes in which large treewidth is witnessed by the presence of a large clique, and the relation of this property to boundedness of the tree‐independence number, a graph parameter introduced independently by Yolov in 2018 and by Dallard, Milanič, and Štorgel ...
Claire Hilaire +2 more
wiley +1 more source
Geometric Planted Matchings Beyond the Gaussian Model
Random Structures &Algorithms, Volume 68, Issue 4, July 2026.ABSTRACT We consider the problem of recovering an unknown matching between a set of n$$ n $$ randomly placed points in ℝd$$ {\mathbb{R}}^d $$ and random perturbations of these points. This can be seen as a model for particle tracking and more generally, entity resolution.
Lucas R. Schwengber, Roberto I. Oliveira
wiley +1 more source
When does a planar bipartite framework admit a continuous deformation?
, 2001 Let K(X,Y) denote the bipartite framework in the plane that realizes the complete bipartite graph Km,n with partite sets X,Y; |X|=m,|Y|=n. We show that for m⩾3,n⩾5, K(X,Y) admits a continuous deformation if and only if X lies on a line ℓ and Y lies on a ...
H. Maehara +3 more
core +1 more source
Expert Systems, Volume 43, Issue 7, July 2026.ABSTRACT Fault‐tolerant monitoring and reliable node identification are essential requirements in modern hierarchical communication systems such as IoT–Fog–Cloud architectures and distributed sensing networks. The fault‐tolerant metric dimension (FTMD) provides an effective graph‐theoretic framework for resilient localization and monitoring in such ...
Ghulam Haidar +5 more
wiley +1 more source
Rectangle-visibility representations of bipartite graphs
, 1997 The paper considers representations of bipartite graphs as rectangle-visibility graphs, i.e., graphs whose vertices are rectangles in the plane, with adjacency determined by horizontal and vertical visibility.
Hutchinson, Joan P. +3 more
core +1 more source
Gluing posets and the dichotomy of poset saturation numbers
Mathematika, Volume 72, Issue 3, July 2026.Abstract Given a finite poset P$\mathcal {P}$, we say that a family F$\mathcal {F}$ of subsets of [n]$[n]$ is P$\mathcal {P}$‐saturated if F$\mathcal {F}$ does not contain an induced copy of P$\mathcal {P}$, but adding any other set to F$\mathcal {F}$ creates an induced copy of P$\mathcal {P}$.
Maria‐Romina Ivan, Sean Jaffe
wiley +1 more source
The FASEB Journal, Volume 40, Issue 11, 15 June 2026.This study revealed a dose‐dependent miRNA buffering mechanism involving extracellular export and storage of miRNA on lipid droplets. The protein HuR facilitates miRNA buffering by dissociating miRNAs from Ago2 and promoting miRNA accumulation on lipid droplets or its extracellular export, depending on cellular requirements.
Sreemoyee Chakraborty +3 more
wiley +1 more source
Graph‐based imitation and reinforcement learning for efficient Benders decomposition
AIChE Journal, Volume 72, Issue 6, June 2026.Abstract This work introduces an end‐to‐end graph‐based agent for accelerating the computational efficiency of Benders Decomposition. The agent's policy is parameterized by a graph neural network, which takes as input a bipartite graph representation of the master problem and proposes a candidate solution.
Bernard T. Agyeman +3 more
wiley +1 more source