Results 81 to 90 of about 6,109 (206)
The FEBS Journal, EarlyView.In this issue, Elmaleh et al. demonstrate that the E425K mutation in DNAJC7, associated with amyotrophic lateral sclerosis, selectively abolishes one of a co‐chaperone's dual functions. High‐resolution NMR confirmed that the mutation leaves the protein's structure intact while paralyzing its communication with the Hsp70 machinery.
Tsung‐Sheng Chiang +2 more
wiley +1 more source
Forest type influence on Heliconia‐dipteran interaction networks
Insect Conservation and Diversity, EarlyView.Responses to forest type depended on the developmental stage of dipterans. Bract traits and forest type influenced larval abundance, but forest type had no impact on adult alpha and beta diversity. Heliconia‐dipteran interaction networks showed a nested pattern for both forest types.
Diana M. Méndez‐Rojas +5 more
wiley +1 more source
International Transactions in Operational Research, EarlyView.Abstract We address the scheduling conflicting jobs on parallel identical machines problem with makespan minimization, a classical and computationally challenging variant of parallel machine scheduling. We develop and evaluate three distinct solution methodologies: a novel constraint programming (CP) formulation, and two metaheuristics: a multi ...
Roberto Maria Rosati +3 more
wiley +1 more source
Algorithmic Aspects of Some Variants of Domination in Graphs
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2020 A set S ⊆ V is a dominating set in G if for every u ∈ V \ S, there exists v ∈ S such that (u, v) ∈ E, i.e., N[S] = V . A dominating set S is an isolate dominating set (IDS) if the induced subgraph G[S] has at least one isolated vertex.
Kumar J. Pavan, Reddy P.Venkata Subba
doaj +1 more source
Subsquares in Random Latin Squares and Rectangles
Journal of Combinatorial Designs, Volume 34, Issue 4, Page 184-197, April 2026.ABSTRACT A k × n partial Latin rectangle is C ‐ sparse if the number of nonempty entries in each row and column is at most C and each symbol is used at most C times. We prove that the probability a uniformly random k × n Latin rectangle, where k < ( 1 ∕ 2 − α ) n, contains a β n‐sparse partial Latin rectangle with ℓ nonempty entries is 1 ± ε n ℓ for ...
Alexander Divoux +3 more
wiley +1 more source
(p,q)-biclique counting and enumeration for large sparse bipartite graphs. [PDF]
VLDB J, 2023 Yang J +5 more
europepmc +1 more source
2-biplacement without fixed points of (p,q)-bipartite graphs [PDF]
Opuscula Mathematica, 2005 In this paper we consider \(2\)-biplacement without fixed points of paths and \((p,q)\)-bipartite graphs of small size. We give all \((p,q)\)-bipartite graphs \(G\) of size \(q\) for which the set \(\mathcal{S}^{*}(G)\) of all \(2\)-biplacements of \(G\)
Beata Orchel
doaj
Journal of Chemistry, 2019 In this paper, with respect to the Wiener index, hyper-Wiener index, and Harary index, it gives some sufficient conditions for some graphs to be traceable, Hamiltonian, Hamilton-connected, or traceable for every vertex.
Guisheng Jiang, Lifang Ren, Guidong Yu
doaj +1 more source
Distance Biregular Bipartite Graphs
European Journal of Combinatorics, 1994 A bipartite connected graph \(B\) is called distance biregular if for every pair of vertices \(x,y\) the number of neighbours \(z\) of \(y\) such that \(d(x,z) = d(x,y) - 1\) depends only on the distance \(d(x,y)\) and the stable components containing \(x\) and \(y\). In particular all vertices of the stable component \(G\) resp.
openaire +2 more sources
Ore‐Type Conditions for Existence of a Jellyfish in a Graph
Journal of Graph Theory, Volume 111, Issue 4, Page 124-143, April 2026.ABSTRACT The famous Dirac's theorem states that for each n ≥ 3 every n‐vertex graph G with minimum degree δ ( G ) ≥ n / 2 has a Hamiltonian cycle. When δ ( G ) < n / 2, this cannot be guaranteed, but the existence of some other specific subgraphs can be provided.
Jaehoon Kim +2 more
wiley +1 more source