Results 111 to 120 of about 21,234 (294)

On leap Zagreb indices of graphs

open access: yesCommunications in Combinatorics and Optimization, 2017
The first and second Zagreb indices of a graph are equal‎, ‎respectively‎, ‎to‎ ‎the sum of squares of the vertex degrees‎, ‎and the sum of the products of‎ ‎the degrees of pairs of adjacent vertices‎.
A.M‎. ‎Naji   +2 more
doaj   +1 more source

GATA4‐Driven Transcription of HtrA1 Promotes Cellular Senescence in Ménière's Disease and Age‐Related Audio‐Vestibular Dysfunction

open access: yesAdvanced Science, EarlyView.
This study identifies the HDAC6/GATA4/HtrA1 axis as a critical driver of cellular senescence in the inner ear. GATA4 nuclear translocation, facilitated by HDAC6 downregulation, transcriptionally activates HtrA1, promoting hair cell senescence, SASP, and audio‐vestibular dysfunction in models of Ménière's disease and age‐related audio‐vestibular ...
Na Zhang   +16 more
wiley   +1 more source

Preferential attachment without vertex growth: emergence of the giant component

open access: yes, 2019
We study the following preferential attachment variant of the classical Erdos-Renyi random graph process. Starting with an empty graph on n vertices, new edges are added one-by-one, and each time an edge is chosen with probability roughly proportional to
Warnke, Lutz, Janson, Svante
core   +1 more source

Mechanostimulatory Cues Determine Intestinal Fibroblast Fate and Profibrotic Remodeling in a Physiodynamic Human Gut‐on‐a‐Chip

open access: yesAdvanced Science, EarlyView.
A healthy gut barrier shields underlying fibroblasts from luminal shear forces, illustrating that “good fences make good neighbors.” Barrier damage exposes fibroblasts to shear stress, inducing cell death and the emergence of stress‐adapted, profibrotic fibroblasts. Sustained shear exposure promotes the formation of stiff aggregates of mechanoadapative
Soyoun Min   +6 more
wiley   +1 more source

A Simple NOVCA: Near Optimal Vertex Cover Algorithm

open access: yes, 2012
This paper describes an extremely fast polynomial time algorithm, the Near Optimal Vertex Cover Algorithm (NOVCA) that produces an optimal or near optimal vertex cover for any known undirected graph G (V, E).
Gajurel, Sanjaya, Bielefeld, Roger
core   +1 more source

PET Imaging of Cardiac Inflammation in Viral Myocarditis Using a DPP4‐Targeted Probe

open access: yesAdvanced Science, EarlyView.
This study describes a DPP4‐targeted PET probe for imaging myocardial inflammation by selectively targeting activated immune cells. Derived from the clinically approved small‐molecule inhibitor linagliptin, the probe demonstrates favorable biodistribution with specific cardiac uptake in myocarditis.
Wanhao Gao   +14 more
wiley   +1 more source

Maximum vertex and face degree of oblique graphs

open access: yesDiscrete Mathematics, 2009
Let G = ( V , E , F ) be a 3-connected simple graph imbedded into a surface S with vertex set V, edge set E and face set F. A face α is an a1, a2, ... , ak-face if α is a k-gon and the degrees of the vertices incident with α in the cyclic order are a1, a2, ... , ak. The lexicographic minimum b1, b2, ... , bk such that α is a b1, b2, ...
Frantisek Kardos, Jozef Miskuf
openaire   +3 more sources

Distributed vertex cover algorithms for wireless sensor networks

open access: yes, 2014
Vertex covering has important applications for wireless sensor networks such as monitoring link failures,facility location, clustering, and data aggregation.
Kavalcı, Vedat   +2 more
core   +1 more source

Nanocellulose Alleviates Intrahepatic Cholestasis of Pregnancy via Gut Microbiota‐Mediated Bile Acid Homeostasis

open access: yesAdvanced Science, EarlyView.
Nanocellulose, derived from microcrystalline cellulose (MCC) through sulfuric acid hydrolysis or mechanical grinding to produce CNC or CNF, was tested in a rat ICP model. Particularly, CNF improved gut microbiota composition, reduced secondary bile acid metabolism, and restored bile acid homeostasis through modulation of the gut–liver axis.
Muhua Yu   +18 more
wiley   +1 more source

Bijective Census and Random Generation of Eulerian Planar Maps with Prescribed Vertex Degrees

open access: yes, 1997
We give a bijection between Eulerian planar maps with prescribed vertex degrees, and some plane trees that we call balanced Eulerian trees. To enumerate the latter, we introduce conjugation classes of planted plane trees. In particular the result answers
Gilles Schaeffer
core  

Home - About - Disclaimer - Privacy