Results 71 to 80 of about 1,930 (230)

Linking preclinical models to clinical realities: VEGF/VEGFR inhibitors and thrombotic microangiopathy in cancer therapy

open access: yesiMetaOmics, EarlyView.
This study investigates the risk of thrombotic microangiopathy (TMA) induced by vascular endothelial growth factor (VEGF) and vascular endothelial growth factor receptor (VEGFR) inhibitors in cancer therapy. Using data from the FDA Adverse Event Reporting System (FAERS), the WHO Global Database for Adverse Drug Reactions (Vigibase), and The Cancer ...
Aimin Jiang   +7 more
wiley   +1 more source

Inheritance principles for chordal graphs

open access: yesLinear Algebra and its Applications, 1991
AbstractWe prove two results concerning positive completions of partial positive matrices. First, we give a parametrization of all positive invertible completions of a partial positive matrix having as support a chordal graph, along a fixed increasing chordal sequence.
Tiberiu Constantinescu, Mihai Bakonyi
openaire   +2 more sources

Generating Subgraphs in Chordal Graphs

open access: yes, 2023
13 pages, 1 figure.
Levit, Vadim E., Tankus, David
openaire   +2 more sources

Hyperbolicity and Chordality of a Graph [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2011
Let $G$ be a connected graph with the usual shortest-path metric $d$. The graph $G$ is $\delta$-hyperbolic provided for any vertices $x,y,u,v$ in it, the two larger of the three sums $d(u,v)+d(x,y),d(u,x)+d(v,y)$ and $d(u,y)+d(v,x)$ differ by at most $2\delta.$ The graph $G$ is $k$-chordal provided it has no induced cycle of length greater than $k ...
Yaokun Wu, Chengpeng Zhang
openaire   +2 more sources

Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT Given a hypergraph H ${\rm{ {\mathcal H} }}$, the dual hypergraph of H ${\rm{ {\mathcal H} }}$ is the hypergraph of all minimal transversals of H ${\rm{ {\mathcal H} }}$. The dual hypergraph is always Sperner, that is, no hyperedge contains another.
Endre Boros   +3 more
wiley   +1 more source

The Topological Connectivity of the Independence Complex of Circular-Arc Graphs

open access: yesUniversal Journal of Mathematics and Applications, 2019
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

Secular Changes in Craniofacial Morphology Over the Last 2000 Years in Milan, Italy

open access: yesInternational Journal of Osteoarchaeology, EarlyView.
ABSTRACT This study aims to analyze secular changes in craniofacial morphology over 2000 years in Milan, examining variations in cranial dimensions across historical periods and between sexes. It utilizes standard anthropometric techniques to provide insights into the evolution of craniofacial morphology within this urban population. The study includes
Lucie Biehler‐Gomez   +4 more
wiley   +1 more source

On the 2-token graph of a graph

open access: yesAKCE International Journal of Graphs and Combinatorics, 2020
Let be a graph and let be a positive integer. Let = and . The -token graph is the graph with vertex set and two vertices and are adjacent if and , where denotes the symmetric difference. In this paper we present several basic results on 2-token graphs.
J. Deepalakshmi   +3 more
doaj   +1 more source

On a Class of Graphs with Large Total Domination Number [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2018
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

Treewidth for graphs with small chordality

open access: yesDiscrete Applied Mathematics, 1997
AbstractA graph G is K-chordal, if it does not contain chordless cycles of length larger than k. The chordality lc of a graph G is the minimum k for which G is k-chordal. The degeneracy or the width of a graph is the maximum min-degree of any of its subgraphs.
Dimitrios M. Thilikos   +1 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy