Results 51 to 60 of about 5,414,210 (302)

On the r-dynamic coloring of some fan graph families

Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2021
In this paper, we determine the r-dynamic chromatic number of the fan graph Fm,n and determine sharp bounds of this graph invariant for four related families of graphs: The middle graph M(Fm,n), the total graph T (Fm,n), the central graph C(Fm,n) and the
Falcón Raúl M., Venkatachalam M., Gowri S., Nandini G.   +3 more
doaj   +1 more source

Graphoidal graphs and graphoidal digraphs: a generalization of line graphs

AKCE International Journal of Graphs and Combinatorics, 2020
A graphoidal cover of a graph G is a collection ψ of paths (not necessarily open) in G such that each path in ψ has at least two vertices, every vertex of G is an internal vertex of at most one path in ψ, and every edge of G is in exactly one path in Let
S. Arumugam, Jay S. Bagga
doaj   +1 more source

From mice to humans—divergent strategies for intestinal homeostasis and regeneration

FEBS Letters, EarlyView.
Recent advances such as organoid genome editing, xenotransplantation, imaging, and whole‐genome sequencing have enabled direct studies of human intestinal stem cells (ISCs). These studies reveal species‐specific features, including slower ISC proliferation, distinct injury responses, slower somatic mutation accumulation in humans, and an inverse ...
Keiko Ishikawa, Shinya Sugimoto, Toshiro Sato   +2 more
wiley   +1 more source

Microbiome‐blood–brain barrier interactions in aging — mechanisms and therapeutic potential

FEBS Letters, EarlyView.
Aging reshapes the gut microbiome (↓SCFA‐producing commensals; ↑pro‐inflammatory outputs), shifting circulating metabolites (↓SCFAs; ↑LPS, ↑TMAO, ↑PAA) that act at the BBB to increase nonspecific transcytosis, alter transport, and promote astrocyte reactivity, heightening brain vulnerability.
Daniel Cuervo‐Zanatta, Hari Baskar Balasubramanian, Amir Pasokh, Marietta Zille   +3 more
wiley   +1 more source

Eulerian Cycle Decomposition Conjecture for the line graph of complete graphs

AKCE International Journal of Graphs and Combinatorics, 2019
The Eulerian Cycle Decomposition Conjecture, by Chartrand, Jordon and Zhang, states that if the minimum number of odd cycles in a cycle decomposition of an Eulerian graph of size is the maximum number of odd cycles in such a cycle decomposition is and is
R. Rajarajachozhan, R. Sampathkumar
doaj   +1 more source

Emerging experimental and computational methods for studying redox‐regulated structural transitions

FEBS Letters, EarlyView.
Redox reactions can reshape proteins and alter how they behave in cells, with important consequences for health and disease. This review explores emerging experimental and computational approaches for discovering these redox‐sensitive protein switches, revealing their structural effects, and predicting their behavior, opening new opportunities to ...
Tasneem Rass, Dana Reichmann, Gábor Erdős   +2 more
wiley   +1 more source

Line-Graph Qubit Routing [PDF]

One limitation of current quantum hardware is the restricted connectivity between qubits, as described by the hardware’s coupling graph. To overcome this limitation, efficient qubit routing strategies are necessary. We introduce line-graph qubit routing,
Hariharan, S. (Seenivasan), Kattemölle, Joris, Hariharan, Seenivasan, Kattemölle, J.J. (Joris)   +3 more
core   +1 more source

Computing Topological Indices and Polynomials for Line Graphs

Mathematics, 2018
A topological index is a number related to the atomic index that allows quantitative structure–action/property/toxicity connections. All the more vital topological indices correspond to certain physico-concoction properties like breaking point ...
Shahid Imran, Muhammad Kamran Siddiqui, Muhammad Imran, Muhammad Faisal Nadeem   +3 more
doaj   +1 more source

Translophagy—A potential link between autophagy impairment and translational errors

FEBS Letters, EarlyView.
Neurodegenerative diseases are characterised by the accumulation of abnormal proteins and protein aggregates, but their origin often remains unknown. We propose that selective autophagy removes damaged protein‐making machinery, preventing errors during protein synthesis.
Mykola V. Korolchuk, Gailing Ma, Robin Antrobus, Diego Manni, Marco Trevisan‐Herraz, Mustafa Khwaja, Max Brown, Gavin D. Richardson, Masaaki Komatsu, Daniel Erskine, Viktor I. Korolchuk, Tetsushi Kataura   +11 more
wiley   +1 more source

LeL-GNN: Learnable Edge Sampling and Line Based Graph Neural Network for Link Prediction

IEEE Access, 2023
Graph neural networks lose a lot of their computing power when more network layers are added. As a result, the majority of existing graph neural networks have a shallow depth of learning. Over-smoothing and information loss are two of the key issues that
Md Golam Morshed, Tangina Sultana, Young-Koo Lee   +2 more
doaj   +1 more source