Results 161 to 170 of about 615,797 (257)
Context‐free graphs and their transition groups
Transactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.Abstract Starting from context‐free inverse graphs, we introduce a new class of groups and study their structural properties. We establish closure properties, show that their coword problems are context‐free, analyze torsion elements, and realize them as subgroups of the asynchronous rational group.
Daniele D'Angeli +3 more
wiley +1 more source
On graph isomorphism for restricted graph classes
, 2006 Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn’t be solved by classifying it as being either NP-complete or solvable in P.
Johannes Köbler
core +1 more source
FEBS Open Bio, Volume 16, Issue 10, Page 1884-1898, October 2026.This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill +4 more
wiley +1 more source
Aggregate, Volume 7, Issue 10, October 2026.This review summarizes recent advances in MOFs for CO2 valorization, covering MOF synthesis, CO2 capture, and photo/electrocatalytic CO2 reduction. Detailed discussion of typical strategies reveals the intrinsic structure–performance relationship, and challenges together with future perspectives are proposed.
Yingjia Li +7 more
wiley +1 more source
A Coarse Geometric Approach to Graph Layout Problems
Journal of Graph Theory, Volume 113, Issue 2, Page 169-194, October 2026.ABSTRACT We define a range of new coarse geometric invariants based on various graph–theoretic measures of complexity for finite graphs, including treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these invariants can be used to define functions which satisfy a strong monotonicity property, namely, they are ...
Wanying Huang +3 more
wiley +1 more source
EURASIP Journal on Information SecurityAnonymization of graph data is fundamental to preserving users’ privacy while publishing social network datasets. The strongest privacy guarantees against any structural attacks provide three well-known methods: k-automorphism, k-isomorphism and k ...
Jana Medková
doaj +1 more source
On a Clique‐Building Game of Erdős
Journal of Graph Theory, Volume 113, Issue 2, Page 208-221, October 2026.ABSTRACT The following game was introduced in a list of open problems from 1983 attributed to Erdős: two players take turns claiming edges of a K n
Alexandru Malekshahian, Sam Spiro
wiley +1 more source
Understanding Graph Isomorphism Network for rs-fMRI Functional Connectivity Analysis. [PDF]
Front Neurosci, 2020 Kim BH, Ye JC.
europepmc +1 more source
Hearing the Serre Invariant of a Compact p‐Adic Analytic Manifold
Mathematische Nachrichten, Volume 299, Issue 10, Page 3126-3138, October 2026.ABSTRACT Using a previous novel way of defining kernel functions for Laplacian integral operators on a compact p$p$‐adic analytic manifold X$X$, one such operator Δ0s$\Delta _0^s$ with s∈R$s\in \mathbb {R}$ is applied to hearing the Serre invariant i(X)$i(X)$ by showing that a wavelet eigenvalue (with the wavelet having small support) is always ...
Patrick Erik Bradley +1 more
wiley +1 more source
A short history of Auto‐Rickshaw
Acta Crystallographica Section D, Volume 82, Issue 10, Page 1139-1151, October 2026.Auto‐Rickshaw is an example of practical, decision‐driven automated macromolecular structure determination from crystallographic diffraction data. This review traces its development at the EMBL Hamburg/DESY beamline environment, where rapid validation of diffraction experiments was essential, through its expansion into a general platform for automated ...
Santosh Panjikar +3 more
wiley +1 more source