Results 71 to 80 of about 919,306 (297)
Inheritance principles for chordal graphs
Linear Algebra and its Applications, 1991 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tiberiu Constantinescu, Mihai Bakonyi
openaire +3 more sources
Generating subgraphs in chordal graphs
Discrete Applied Mathematics, 2023 13 pages, 1 figure.
Vadim E. Levit, David Tankus
openaire +2 more sources
Advanced Biology, EarlyView.The unrolling of the peltate leaves in Syngonium podophyllum is analyzed and quantified (left‐hand side to center). These measurements serve to verify a mathematical model for leaf unrolling based on the model used in Schmidt (2007). An additional formula for obtaining a layer mismatch from a prescribed radius is derived.
Michelle Modert +4 more
wiley +1 more source
Computing Minimum Rainbow and Strong Rainbow Colorings of Block Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 A path in an edge-colored graph $G$ is rainbow if no two edges of it are colored the same. The graph $G$ is rainbow-connected if there is a rainbow path between every pair of vertices.
Melissa Keranen, Juho Lauri
doaj +1 more source
Discrete Applied Mathematics, 2002 A chordally signed graph is defined as a signed chordal graph (each edge is designated as being positive or negative and every induced cycle is a triangle) in which every cycle \(C\) containing an even number of negative edges (positive cycles) has a chord \(e\) such that \(C\cup\{e\}\) forms two positive cycles.
openaire +2 more sources
Advanced Science, EarlyView.This research integrated multi‐omics analysis of bone tissue from HLU and control mice revealed that mechanical unloading suppresses intrinsic apoptosis and augments glutamine (Gln) catabolism in osteoclast lineage cells. The findings highlight pivotal roles for SLC1A5‐mediated Gln metabolism and XIAP/Diablo axis‐mediated apoptosis suppression.
Yi Ding +14 more
wiley +1 more source
3-Colourability of Dually Chordal Graphs in Linear Time [PDF]
, 2012 A graph G is dually chordal if there is a spanning tree T of G such that any maximal clique of G induces a subtree in T. This paper investigates the Colourability problem on dually chordal graphs.
Leitert, Arne
core
Endothelial BMP6 Drives Hemodynamic‐Dependent VSMCs Calcification in Carotid Atherosclerosis
Advanced Science, EarlyView.The study demonstrates that endothelial cell (EC)‐derived BMP6 promotes the osteogenic differentiation of vascular smooth muscle cells (VSMCs) through cell‐cell interactions. Additionally, the researchers preliminarily explore the driving effect of hemodynamic factors on BMP6‐induced calcification and reveal the regulatory role of KLF4 on BMP6.
Shen Li +12 more
wiley +1 more source
The Hadwiger number, chordal graphs and -perfection
AKCE International Journal of Graphs and Combinatorics, 2017 A graph is chordal if every induced cycle has three vertices. The Hadwiger number is the order of the largest complete minor of a graph. We characterize the chordal graphs in terms of the Hadwiger number and we also characterize the families of graphs ...
Christian Rubio-Montiel
doaj +1 more source
On an edge partition and root graphs of some classes of line graphs
Electronic Journal of Graph Theory and Applications, 2017 The Gallai and the anti-Gallai graphs of a graph $G$ are complementary pairs of spanning subgraphs of the line graph of $G$. In this paper we find some structural relations between these graph classes by finding a partition of the edge set of the line ...
K Pravas, A. Vijayakumar
doaj +1 more source