Results 11 to 20 of about 184,697 (198)

Exactly Hittable Interval Graphs

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2023
Given a set system $\mathcal{X} = \{\mathcal{U},\mathcal{S}\}$, where $\mathcal{U}$ is a set of elements and $\mathcal{S}$ is a set of subsets of $\mathcal{U}$, an exact hitting set $\mathcal{U}'$ is a subset of $\mathcal{U}$ such that each subset in $\mathcal{S}$ contains exactly one element in $\mathcal{U}'$.
S. M. Dhannya   +2 more
openaire   +3 more sources

Steiner intervals in graphs

open access: yesDiscrete Applied Mathematics, 1998
AbstractLetG be a graph andu, v two vertices ofG. Then the interval fromu tov consists of all those vertices that lie on some shortestu — v path. LetS be a set of vertices in a connected graphG. Then the Steiner distancedG(S) ofS inG is the smallest number of edges in a connected subgraph ofG that containsS. Such a subgraph is necessarily a tree called
Ewa Kubicka   +2 more
openaire   +2 more sources

On Homogeneously Representable Interval Graphs [PDF]

open access: yesNational Academy Science Letters, 2015
We determine all graphs whose line graphs (middle graphs, total graphs, respectively) are homogeneously representable interval graphs.
Jerzy Topp   +2 more
openaire   +2 more sources

Interval graphs and interval orders

open access: yesDiscrete Mathematics, 1985
AbstractThis paper explores the intimate connection between finite interval graphs and interval orders. Special attention is given to the family of interval orders that agree with, or provide representations of, an interval graph. Two characterizations (one by P. Hanlon) of interval graphs with essentially unique agreeing interval orders are noted, and
openaire   +1 more source

Counting interval graphs [PDF]

open access: yesTransactions of the American Mathematical Society, 1982
In this paper we enumerate interval graphs (up to isomorphism) along with labelled interval graphs, identity interval graphs, transitive interval graphs and various sorts of unit interval graphs. The enumeration makes use of a structural decomposition of interval graphs which leads to a characterization of those interval graphs having a unique interval
openaire   +2 more sources

Social context prevents heat hormetic effects against mutagens during fish development

open access: yesFEBS Letters, EarlyView.
This study shows that sublethal heat stress protects fish embryos against ultraviolet radiation, a concept known as ‘hormesis’. However, chemical stress transmission between fish embryos negates this protective effect. By providing evidence for the mechanistic molecular basis of heat stress hormesis and interindividual stress communication, this study ...
Lauric Feugere   +5 more
wiley   +1 more source

On counting interval lengths of interval graphs

open access: yesDiscrete Applied Mathematics, 2011
AbstractGiven an interval graph G, the interval count problem is that of computing the minimum number IC(G) of interval lengths needed to represent G. Although the problem of deciding whether IC(G)=1 is equivalent to that of recognizing unit-interval graphs, which is a well-known problem having several efficient recognition approaches, very little is ...
Fabiano de S. Oliveira   +2 more
openaire   +2 more sources

Inhibition of acyl‐CoA synthetase long‐chain isozymes decreases multiple myeloma cell proliferation and causes mitochondrial dysfunction

open access: yesMolecular Oncology, Volume 19, Issue 6, Page 1687-1706, June 2025.
Triacsin C inhibition of the acyl‐CoA synthetase long chain (ACSL) family decreases multiple myeloma cell survival, proliferation, mitochondrial respiration, and membrane potential. Made with Biorender.com. Multiple myeloma (MM) is an incurable cancer of plasma cells with a 5‐year survival rate of 59%.
Connor S. Murphy   +12 more
wiley   +1 more source

Recognizing edge clique graphs among interval graphs and probe interval graphs

open access: yesApplied Mathematics Letters, 2007
AbstractThe edge clique graph of a graph H is the one having the edge set of H as vertex set, two vertices being adjacent if and only if the corresponding edges belong to a common complete subgraph of H. We characterize the graph classes {edge clique graphs} ∩ {interval graphs} as well as {edge clique graphs} ∩ {probe interval graphs}, which leads to ...
Jing Kong, Yaokun Wu
openaire   +2 more sources

Cell‐free DNA aneuploidy score as a dynamic early response marker in prostate cancer

open access: yesMolecular Oncology, EarlyView.
mFast‐SeqS‐based genome‐wide aneuploidy scores are concordant with aneuploidy scores obtained by whole genome sequencing from tumor tissue and can predict response to ARSI treatment at baseline and, at an early time point, to ARSI and taxanes. This assay can be easily performed at low cost and requires little input of cfDNA. Cell‐free circulating tumor
Khrystany T. Isebia   +17 more
wiley   +1 more source

Home - About - Disclaimer - Privacy