Results 101 to 110 of about 3,086,920 (343)

The distance seidel spectrum of some graph operations [PDF]

open access: yesJournal of Hyperstructures
The distance matrix, distance eigenvalue, and distance energy of a connected graph have been studied in detail in literature where as the study on distance seidel matrix associated with a connected graph is in progress. The eigenvalues ∂1S≥∂2S≥ ...
Deena Scaria, Indulal Gopal
doaj   +1 more source

Distance-regular antipodai covering graphs

open access: yesJournal 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

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

open access: yesFEBS 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   +7 more
wiley   +1 more source

D-bounded Distance-regular Graphs

open access: yesEuropean 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

Hamiltonian Strongly Regular Graphs [PDF]

open access: yes
We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Petersen graph is the only connected non-Hamiltonian strongly regular graph on fewer than 99 vertices.Distance-regular graphs;Hamilton cycles JEL ...
Brouwer, A.E., Haemers, W.H.
core  

Heterotropic regulation and negative homotropic cooperativity

open access: yesFEBS 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   +5 more
wiley   +1 more source

Resistance Distance and Kirchhoff Index of the Corona-Vertex and the Corona-Edge of Subdivision Graph

open access: yesIEEE Access, 2018
The resistance distance is widely used in random walk, electronic engineering, and complex networks. One of the main topics in the study of the resistance distance is the computation problem.
Qun Liu, Jia-Bao Liu, Shaohui Wang
doaj   +1 more source

Distance-regular graphs of hamming type

open access: yesJournal 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

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

open access: yesFEBS 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   +11 more
wiley   +1 more source

Distance-regular graphs [PDF]

open access: yes, 2016
This is a survey of distance-regular graphs. We present an introduction to distance-regular graphs for the reader who is unfamiliar with the subject, and then give an overview of some developments in the area of distance-regular graphs since the ...
Tanaka, Hajime   +2 more
core   +2 more sources

Home - About - Disclaimer - Privacy