Results 101 to 110 of about 118,378,802 (306)

Labeling, Covering and Decomposing of Graphs — Smarandache’s Notion in Graph Theory [PDF]

open access: yes, 2010
This paper surveys the applications of Smarandache’s notion to graph theory appeared in International J.Math.Combin. from Vol.1,2008 to Vol.3,2009.
Mao, Linfan, Linfan Mao
core   +1 more source

Comparative assessment of crystallographic and cryo‐EM models in the Protein Data Bank

open access: yesFEBS Open Bio, EarlyView.
Raw data obtained by X‐ray crystallography or cryo‐EM result in experimental maps, ultimately fitted by atomic models. Although the physical principles are different, the final results can be viewed, compared, and evaluated in the same way. With cryogenic electron microscopy (cryo‐EM) on track to surpass X‐ray crystallography as the preferred method ...
Alexander Wlodawer   +7 more
wiley   +1 more source

Bounds on separated pairs of subgraphs, eigenvalues and related polynomials [PDF]

open access: yes
We give a bound on the sizes of two sets of vertices at a given minimum distance (a separated pair of subgraphs) in a graph in terms of polynomials and the spectrum of the graph. We find properties of the polynomial optimizing the bound.
Dam, E.R. van
core  

RNA Sequencing Resolves Cryptic Pathogenic Variants in Mitochondrial Disease

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Mitochondrial diseases are the most common inherited metabolic disorders, characterized by pronounced clinical and genetic heterogeneity that complicates molecular diagnosis. Although DNA‐based sequencing approaches have become standard in genetic testing, up to half of patients remain without a definitive diagnosis.
Zhimei Liu   +21 more
wiley   +1 more source

Characterization Of Super-Radial Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2014
In a graph G, the distance d(u, v) between a pair of vertices u and v is the length of a shortest path joining them. The eccentricity e(u) of a vertex u is the distance to a vertex farthest from u.
Kathiresan K.M.   +2 more
doaj   +1 more source

Connectivity of distance graphs

open access: yesDiscrete Mathematics, 1992
Let \(K\supseteq\mathbb{Q}\) be a \(\mathbb{Z}\)-module and \(G\) a graph with a \(K\)- space as vertex set \(V\). If the edges of \(G\) are preserved under translations in \(V\) and \(G\) has more than one connected component, then the author shows that \(G\) has infinitely many components.
openaire   +2 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  

Neurologic Manifestations of Long COVID Affect Adult Females More Severely Than Males

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective To characterize differences in neurologic manifestations of postacute sequelae of SARS‐CoV‐2 infection (Neuro‐PASC) between females and males. Methods Cross‐sectional study of the first consecutive 261 posthospitalization Neuro‐PASC (PNP) and 2068 nonhospitalized Neuro‐PASC (NNP) patients evaluated at the Neuro‐COVID clinic between ...
Hannah Kopinsky   +5 more
wiley   +1 more source

Gravity‐Dependent Modulation of Downbeat Nystagmus: Insights From Velocity‐Storage Dysfunction

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Downbeat nystagmus varies with head position, a phenomenon termed gravity‐dependent modulation. We aimed to clarify its mechanism using a velocity‐storage model. Methods In 10 patients with downbeat nystagmus due to cerebellar disorders, we recorded eye movements at different pitch‐ and roll‐axis head positions.
Ji‐Hyung Park   +5 more
wiley   +1 more source

Non-Inclusive and Inclusive Distance Irregularity Strength of Complement and Split Graphs

open access: yesScience and Technology Indonesia
Let $f$ be a map from vertices of a graph $G$ to number from $1$ to $k$. The labeling $f$ is called distance irregular if for every two vertices $x$ and $y$, it holds that $wt_f(u) \ne wt_f(v)$ where a weight $wt_f(u)$ is defined as the sum of labels of
Tita Khalis Maryati, Fawwaz Fakhrurrozi
doaj   +1 more source

Home - About - Disclaimer - Privacy