Results 81 to 90 of about 12,115 (251)
Chordal multipartite graphs and chordal colorings
A graph is defined to be chordal colorable if it admits a proper vertex-coloring such that each minimal separator induces a subgraph in which two vertices are adjacent if and only if they are differently colored. All chordal graphs and all chordal bipartite graphs are chordal colorable. All chordal colorable graphs are weakly chordal.
openaire +1 more source
Using human induced pluripotent stem cells (hiPSCs)‐derived neuronal model, Tian and colleagues reveal that voltage‐gated calcium channels Cav1.2 and Cav1.3, and their mediated calcium ion influx, are essential for early morphogenesis of human neuronal development, while ECEL1 underlies human neuronal functional developmental maturation through CALM3 ...
Yue Tian +5 more
wiley +1 more source
The Topological Connectivity of the Independence Complex of Circular-Arc Graphs
Let us denoted the topological connectivity of a simplicial complex $C$ plus 2 by $\eta(C)$. Let $\psi$ be a function from class of graphs to the set of positive integers together with $\infty$. Suppose $\psi$ satisfies the following properties: \newline
Yousef Abd Algani
doaj +1 more source
Distance Approximating Trees for Chordal and Dually Chordal Graphs [PDF]
Summary: We show that, for each chordal graph \(G\), there is a tree \(T\) such that \(T\) is a spanning tree of the square \(G^2\) of \(G\) and, for every two vertices, the distance between them in \(T\) is not larger than the distance in \(G\) plus 2.
Brandstädt, Andreas +2 more
openaire +2 more sources
Nap1l4a is required in erythropoiesis and hypoxia responses via physical interaction with Klf1 and Scl to recruit the histone variant H2A.Z. This facilitates its associated cis‐regulatory element (CRE) remodeling and the consequent chromatin assembly, and activates the transcription of erythroid lineage‐specific genes.
JiaHao Shi +10 more
wiley +1 more source
On a Class of Graphs with Large Total Domination Number [PDF]
Let $\gamma(G)$ and $\gamma_t(G)$ denote the domination number and the total domination number, respectively, of a graph $G$ with no isolated vertices. It is well-known that $\gamma_t(G) \leq 2\gamma(G)$.
Selim Bahadır, Didem Gözüpek
doaj +1 more source
This paper studies dual-chordal graphs, that is, graphs that are dual to chordal graphs with regard to cycle/cutset duality. A characteristic of such graphs is that every cutset with at least four edges is accompanied by a certain kind of edge, a ``cut-chord.'' One result allows us to recognize dual-chordal graphs by simply looking at cubic graphs.
openaire +1 more source
Generating Weakly Chordal Graphs from Arbitrary Graphs
We propose a scheme for generating a weakly chordal graph from a randomly generated input graph, G = (V, E). We reduce G to a chordal graph H by adding fill-edges, using the minimum vertex degree heuristic. Since H is necessarily a weakly chordal graph, we use an algorithm for deleting edges from a weakly chordal graph that preserves the weak ...
Khanduja, Sudiksha +3 more
openaire +2 more sources
GSK3β‐Regulated Lipolysis is Required for Histone Acetylation and Decidualization in Early Pregnancy
Uterine Gsk3b knockout impairs decidual cell terminal differentiation by causing lipid droplet accumulation. GSK3β phosphorylates RNF213 to promote its lysosomal degradation, thereby enhancing lipolysis. The released fatty acids undergo β‐oxidation to generate acetyl‐CoA, which modulates histone acetylation and regulates decidual cell terminal ...
Peiran Wang +14 more
wiley +1 more source
Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources

