Results 61 to 70 of about 1,376 (263)

Extremal Matching Energy of Random Polyomino Chains

open access: yesEntropy, 2017
Polyomino graphs is one of the research objectives in statistical physics and in modeling problems of surface chemistry. A random polyomino chain is a subgraph of a polyomino graph.
Tingzeng Wu, Huazhong Lü, Xuexin Zhang
doaj   +1 more source

Electroencephalographic Normalization as a Biomarker of Clinical Recovery in Down Syndrome Regression Disorder

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Down syndrome regression disorder is a syndrome characterized by subacute loss of cognitive, behavioral, and functional abilities in individuals with Down syndrome. Electroencephalography abnormalities are frequently observed during evaluation, but it remains unclear whether these findings represent a dynamic marker of disease ...
Jonathan D. Santoro   +14 more
wiley   +1 more source

Extremals of functions on graphs with applications to graphs and hypergraphs

open access: yesJournal of Combinatorial Theory, Series B, 1982
AbstractThe method used in an article by T. S. Matzkin and E. G. Straus [Canad. J. Math. 17 (1965), 533–540] is generalized by attaching nonnegative weights to t-tuples of vertices in a hypergraph subject to a suitable normalization condition. The edges of the hypergraph are given weights which are functions of the weights of its t-tuples and the graph
T. Sós, Vera, Straus, E. G.
openaire   +3 more sources

Stem Cell Transplantation in Friedreich Ataxia: Cure for Leukemia but No Effect on Neurological Progression

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Friedreich Ataxia (FRDA) is a neurodegenerative disorder of children and young adults associated with cardiomyopathy and other systemic complications. We report a 10‐year‐old girl who presented simultaneously with Acute Myelogenous Leukemia and FRDA who was successfully treated for her leukemia with allogeneic hematopoietic stem cell ...
Alexandra Gitman   +5 more
wiley   +1 more source

Further results on permanents of Laplacian matrices of trees

open access: yesOpen Mathematics
The research on the permanents of graph matrices is one of the contemporary research topic in algebraic combinatorics. Brualdi and Goldwasser characterized the upper and lower bounds of permanents of Laplacian matrices of trees.
Wu Tingzeng, Dong Xiangshuai
doaj   +1 more source

On the KG-Sombor index

open access: yesVojnotehnički Glasnik
Introduction/purpose: Degree-based graph invariants are a type of molecular descriptor that represent the connectivity of atoms (vertices) in a molecule through bonds (edges). They are used to model structural properties of molecules and provide valuable
Ochirbat Altangoo   +3 more
doaj   +1 more source

On extremal k-outconnected graphs

open access: yesDiscrete Mathematics, 2008
The author cites two results of \textit{W. Mader} [Arch. Math. 23, 553--560 (1972; Zbl 0228.05119), Math. Nachr. 53, 145--150 (1972; Zbl 0217.02504), and Abh. Math. Semin. Univ. Hamb. 37, 86--97 (1972; Zbl 0215.33803)] and one of \textit{M. Cai} [Discrete Math. 41, 229--234 (1982; Zbl 0522.05040)] for minimally \(k\)-connected graphs.
openaire   +1 more source

Intracerebral Hemorrhage Induces Monocyte TNF Signaling in Patients That Is Suppressed by BAF312

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Intracerebral hemorrhage (ICH) causes high morbidity and mortality, with neurotoxic inflammation driven by infiltrating monocytes. This study is an in‐depth longitudinal examination of the immune response during the first week of ICH in the presence and absence of the immunomodulatory drug BAF312 (Siponimod).
Jonathan Howard DeLong   +10 more
wiley   +1 more source

List graphs and distance-consistent node labelings

open access: yesElectronic Journal of Graph Theory and Applications, 2018
In this paper we consider node labelings c of an undirected connected graph G = (V, E) with labels {1, 2, ..., ∣V∣}, which induce a list distance c(u, v) = ∣c(v) − c(u)∣ besides the usual graph distance d(u, v).
Håkan Lennerstad, Mattias Eriksson
doaj   +1 more source

On Vertex Degree-Based Topological Indices for Fixed Branching Vertices of Trees

open access: yesJournal of Chemistry, 2022
The Gourava indices and hyper-Gourava indices are graph invariants, related to the degree of vertices of a graph G. Let Tn,b denote the collection of all chemical trees with n vertices where b denotes the number of branching vertices, 1 ...
Muzamil Hanif   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy