Results 51 to 60 of about 259,405 (306)

Colourings of $(m, n)$-coloured mixed graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science
A mixed graph is, informally, an object obtained from a simple undirected graph by choosing an orientation for a subset of its edges. A mixed graph is $(m, n)$-coloured if each edge is assigned one of $m \geq 0$ colours, and each arc is assigned one of ...
Gary MacGillivray   +2 more
doaj   +1 more source

Learning linear non-Gaussian graphical models with multidirected edges

open access: yesJournal of Causal Inference, 2021
In this article, we propose a new method to learn the underlying acyclic mixed graph of a linear non-Gaussian structural equation model with given observational data.
Liu Yiheng, Robeva Elina, Wang Huanqing
doaj   +1 more source

Emerging role of ARHGAP29 in melanoma cell phenotype switching

open access: yesMolecular Oncology, EarlyView.
This study gives first insights into the role of ARHGAP29 in malignant melanoma. ARHGAP29 was revealed to be connected to tumor cell plasticity, promoting a mesenchymal‐like, invasive phenotype and driving tumor progression. Further, it modulates cell spreading by influencing RhoA/ROCK signaling and affects SMAD2 activity. Rho GTPase‐activating protein
Beatrice Charlotte Tröster   +3 more
wiley   +1 more source

Some results concerning the solution mappings of mixed variational inequality problems

open access: yesJournal of Inequalities and Applications, 2016
This paper shows some continuities of mappings between the space of mixed variational inequality problems and the graph space of their solution mappings.
Qi-Qing Song, Hui Yang
doaj   +1 more source

Bivariate Chromatic Polynomials of Mixed Graphs

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2023
The bivariate chromatic polynomial $\chi_G(x,y)$ of a graph $G = (V, E)$, introduced by Dohmen-P\"{o}nitz-Tittmann (2003), counts all $x$-colorings of $G$ such that adjacent vertices get different colors if they are $\le y$. We extend this notion to mixed graphs, which have both directed and undirected edges.
Beck, Matthias, Kolhatkar, Sampada
openaire   +5 more sources

Modeling hepatic fibrosis in TP53 knockout iPSC‐derived human liver organoids

open access: yesMolecular Oncology, EarlyView.
This study developed iPSC‐derived human liver organoids with TP53 gene knockout to model human liver fibrosis. These organoids showed elevated myofibroblast activation, early disease markers, and advanced fibrotic hallmarks. The use of profibrotic differentiation medium further amplified the fibrotic signature seen in the organoids.
Mustafa Karabicici   +8 more
wiley   +1 more source

A Geometric Property of the Laplacian matrix of a Connected Nonsingular Mixed Graph

open access: yesJournal of Chemistry, 2020
In this paper, we give a geometric interpretation of the Laplacian matrix of a connected nonsingular mixed graph which generalizes the results of M. Fiedler (M. Fiedler, Geometry of the Laplacian, Linear Algebra Appl., 2005, 403: 409–413).
Zheng-Da Zhou, Shi-Cai Gong
doaj   +1 more source

The mixed page number of graphs

open access: yesTheoretical Computer Science, 2022
A linear layout of a graph typically consists of a total vertex order, and a partition of the edges into sets of either non-crossing edges, called stacks, or non-nested edges, called queues. The stack (queue) number of a graph is the minimum number of required stacks (queues) in a linear layout.
Jawaherul Md. Alam   +4 more
openaire   +2 more sources

In vitro properties of patient serum predict clinical outcome after high dose rate brachytherapy of hepatocellular carcinoma

open access: yesMolecular Oncology, EarlyView.
Following high dose rate brachytherapy (HDR‐BT) for hepatocellular carcinoma (HCC), patients were classified as responders and nonresponders. Post‐therapy serum induced increased BrdU incorporation and Cyclin E expression of Huh7 and HepG2 cells in nonresponders, but decreased levels in responders.
Lukas Salvermoser   +14 more
wiley   +1 more source

Home - About - Disclaimer - Privacy