Results 111 to 120 of about 120,514 (220)
The minimum size of a chordal graph with given order and minimum degree [PDF]
A graph is chordal if it does not contain an induced cycle of length greater than three. We determine the minimum size of a chordal graph with given order and minimum degree. In doing so, we have discovered interesting properties of chordal graphs.
arxiv
Tauopathy after long‐term cervical lymphadenectomy
Abstract INTRODUCTION This study examined the effects of long‐term cervical lymphadenectomy (cLE) on cognitive and Alzheimer's disease (AD)–like tauopathy changes. METHODS Male C57BL/6 mice were used to assess cLE impacts on sleep, brain pathways, and pathologies.
Chenrui Wu+7 more
wiley +1 more source
ABSTRACT Advancements in modern engineering design require materials that maintain thermal and mechanical stability under diverse conditions. To promote sustainability and eco‐friendliness, researchers are increasingly exploring natural alternatives to synthetic fibers.
Md Atiqur Rahman+3 more
wiley +1 more source
It is worth mentioning that the first report evaluating the phenolic profile and pharmacological potential of B. trixago indicated that the plants could be a promising source of bioactive molecules with therapeutic potential against oxidative stress diseases. ABSTRACT Bellardia trixago (L.) All.
Mehmet Veysi Cetiz+12 more
wiley +1 more source
Automated design of dynamic programming schemes for RNA folding with pseudoknots. [PDF]
Marchand B+4 more
europepmc +1 more source
Labeling algorithms for domination problems in sun-free chordal graphs
Gerard J. Chang
openalex +1 more source
In Pggt1b‐deficient macrophages, TLR4 may be in a highly activated state and can be activated by R848 or DAMPS, which strongly correlated with increased cytokine production, interferon‐γ production, augmented amide binding and transferase activity, and the activation of NF‐κB and/or Nlrp3 inflammasome pathways.
Shanshan Yu+4 more
wiley +1 more source
Word-Representability of Well-Partitioned Chordal Graphs [PDF]
In this paper, we study the word-representability of well-partitioned chordal graphs using split decomposition. We show that every component of the minimal split decomposition of a well-partitioned chordal graph is a split graph. Thus we have a characterization for word-representability of well-partitioned chordal graphs.
arxiv