Results 101 to 110 of about 114,426,441 (303)
Hamiltonian Strongly Regular Graphs [PDF]
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
Getting new algorithmic results by extending distance-hereditary graphs via split composition. [PDF]
PeerJ Comput Sci, 2021 Cicerone S, Di Stefano G.
europepmc +1 more source
Discrete Mathematics, 1982 AbstractThe boolean distance between two points x and y of a connected graph G is defined as the set of all points on all paths joining x and y in G (Ø if x = y). It is determined in terms of the block-cutpoint graph of G, and shown to satisfy the triangle inequality b(x,y)⊆ b(x, z)∪b(z,y). We denote by B(G) the collection of distinct boolean distances
Frank Harary +3 more
openaire +4 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 +5 more
wiley +1 more source
Developments on Spectral Characterizations of Graphs [PDF]
In [E.R. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Appl. 373 (2003), 241-272] we gave a survey of answers to the question of which graphs are determined by the spectrum of some matrix associated to the graph.
Dam, E.R. van, Haemers, W.H.
core
The Distance Matrices of Some Graphs Related to Wheel Graphs
Journal of Applied Mathematics, 2013 Let D denote the distance matrix of a connected graph G. The inertia of D is the triple of integers (n+(D), n0(D), n-(D)), where n+(D), n0(D), and n-(D) denote the number of positive, 0, and negative eigenvalues of D, respectively.
Xiaoling Zhang, Chengyuan Song
doaj +1 more source
Discrete Mathematics, 1977 AbstractThe average or mean of the distances between vertices in a connected graph Γ, μ(Γ), is a natural measure of the compactness of the graph. In this paper we compute bounds for μ(Γ) in terms of the number of vertices in Γ and the diameter of Γ. We prove a formula for computing μ(Γ) when Γ is a tree which is particularly useful when Γ has a high ...
J. K. Doyle, Jack E. Graver
openaire +3 more sources
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 +7 more
wiley +1 more source
Consensus Strategies for Signed Profiles on Graphs [PDF]
The median problem is a classical problem in Location Theory: one searches for a location that minimizes the average distance to the sites of the clients. This is for desired facilities as a distribution center for a set of warehouses. More recently, for
Changat, M. +3 more
core
In silico and in vitro exploration of a tyrosinase for biocatalytic production of catechols
FEBS Open Bio, EarlyView.Tyrosinase from Ralstonia pseudosolanacearum is a promising biocatalyst for producing valuable catechols from monophenol substrates. This tyrosinase is uniquely suited to this due to its high monophenolase : diphenolase ratio. We combined in silico docking and in vivo kinetic characterisation of this tyrosinase with 11 industrially relevant monophenols,
James Britton +6 more
wiley +1 more source