Results 71 to 80 of about 42,350 (268)

A Novel Description on Vague Graph with Application in Transportation Systems

Journal of Mathematics, 2021
Fuzzy graph (FG) models embrace the ubiquity of existing in natural and man-made structures, specifically dynamic processes in physical, biological, and social systems.
Zheng Kou, Saeed Kosari, Maryam Akhoundi
doaj   +1 more source

Locally Pseudo-Distance-Regular Graphs

Journal of Combinatorial Theory, Series B, 1996
The concept of local pseudo-distance-regularity, introduced in this paper, can be thought of as a natural generalization of distance-regularity for non-regular graphs. Intuitively speaking, such a concept is related to the regularity of graph \(\Gamma\) when it is seen from a given vertex.
Miguel Angel Fiol, Ernest Garriga, José Luis Andres Yebra   +2 more
openaire   +2 more sources

Importin 7 mediates the nuclear import of HIV‐1 integrase via a specific interacting interface

FEBS Open Bio, EarlyView.
HIV‐1 integrase enables viral DNA integration into the host genome. By binding to the core domain of the host protein Importin 7 via its C‐terminal domain, the integrase is transported across the nuclear membrane into the nucleus, where integration of the viral genome into host DNA takes place. This translocation is a critical step for subsequent viral
Juana Bana, Avigail Yariv, Tal Oppenheim, Hadar Amartely, Dana Reichmann, Oded Livnah   +5 more
wiley   +1 more source

Evaluating the effect of γ‐oryzanol on MASLD pathology using a medaka fish model

FEBS Open Bio, EarlyView.
This study explores a liver disease called MASLD, which is increasing worldwide and can lead to serious damage. Researchers used medaka fish instead of rodents to test a food compound, γ‐oryzanol. Fish fed this compound had less liver fat and healthier gut bacteria.
Yukako Ito, Haduki Asano, Ayano Ueki, Joe Sakamoto, Yasuhiro Kamei, Hayato Tokumoto, Ayaka Yazawa, Shigeki Kamitani   +7 more
wiley   +1 more source

Distance-regular antipodai covering graphs

Journal of Combinatorial Theory, Series B, 1988
Let G be a regular graph with diameter d. G is said to be antipodal if given any distinct vertices u, v, w of G with v and w at distance d from u, then v is distance d from w. G is called distance-regular if for vertices u, v, in G of distance i apart, v is adjacent to \(c_ i\) vertices distance i-1 from u, \(a_ i\) vertices distance i from u, and \(b_
Robert E. L. Aldred, Chris D. Godsil
openaire   +2 more sources

Heterotropic regulation and negative homotropic cooperativity

FEBS Open Bio, EarlyView.
We identified a structural module common to some proteins that couple negative cooperativity with heterotropic regulation, two features that rarely coexist. These proteins are ring‐like and present an ordered asymmetry whereby noncontacting subunits are symmetric, and their tertiary structure differs from that of contacting subunits.
Veronica Morea, Francesco Angelucci, Federica Arnesano, Gianmarco Pascarella, Patrizio Di Micco, Andrea Bellelli   +5 more
wiley   +1 more source

D-bounded Distance-regular Graphs

European Journal of Combinatorics, 1997
Let \(\Gamma\) be a distance-regular graph of diameter \(D\geq 3\). The paper gives all basic facts from the literature and all necessary notions, e.g. the notion of weak-geodetically closed subgraph of \(\Gamma\), the notion of \(D\)-bounded graph, etc. Let \(P(\Gamma)\) denote the poset the elements of which are the weak-geodetically closed subgraphs
openaire   +4 more sources

GelMA‐based 3D spheroids recapitulate transcriptomic and functional hallmarks of myeloid sarcoma

FEBS Open Bio, EarlyView.
GelMA 5% hydrogels support the formation of myeloid leukemia spheroids that recapitulate MS‐specific features, including G1 arrest, apoptosis, and ECM‐driven transcriptomic reprogramming. The 3D model mimicked soft‐tissue‐like stiffness and oxygen conditions, and transcriptomic convergence with primary MS samples confirmed its utility as a preclinical ...
Nicolas Germain, Elise Buret, Le Hoang Thanh Nguyen, Marion Cocheteux, Nicolas Touya, Mélanie Dhayer, Romain Dubois, Frank Lafont, Sebastien Janel, Patrice Maboudou, Steve Lancel, Philippe Marchetti   +11 more
wiley   +1 more source

ON \(G\)-VERTEX-TRANSITIVE COVERS OF COMPLETE GRAPHS HAVING AT MOST TWO \(G\)-ORBITS ON THE ARC SET

Ural Mathematical Journal
We investigate abelian (in the sense of Godsil and Hensel) distance-regular covers  of complete graphs with the following property: there is a vertex-transitive group of automorphisms of the cover which possesses at most two orbits in the induced action ...
Ludmila Yu. Tsiovkina
doaj   +1 more source

Distance-regular graphs of hamming type

Journal of Combinatorial Theory, Series B, 1990
An H(e,\(\lambda\),k)-graph is defined to be a distance-regular graph with the following intersection array \[ \left\{\begin{matrix} 0 & 1 & 2 &... & e-1 & e & *...* \\ 0 & \lambda & 2\lambda & ... & (e-1)\lambda & * & *...* & \\ k & * & * & ... & * & * & *...* \end{matrix}\right\} \] where * takes an arbitrary value under the restriction that each ...
openaire   +3 more sources