Results 21 to 30 of about 184,697 (198)
On the Cubicity of Interval Graphs
Graphs and Combinatorics, 2007 Abstract A k-cube (or “a unit cube in k dimensions”) is defined as the Cartesian product R 1 × … × R k where R i (for 1 ⩽ i ⩽ k ) is an interval of the form [ a i , a i + 1 ] on the real line. The k -cube representation of a graph G is a mapping of the vertices of G to k -cubes such that the
Chandran, L Sunil +2 more
openaire +3 more sources
Interval k-Graphs and Orders [PDF]
Order, 2017 An interval $k$-graph is the intersection graph of a family $\mathcal{I}$ of intervals of the real line partitioned into at most $k$ classes with vertices adjacent if and only if their corresponding intervals intersect and belong to different classes.
David E. Brown +2 more
openaire +3 more sources
Molecular Oncology, Volume 19, Issue 6, Page 1775-1796, June 2025.NAD+ regeneration by mitochondrial complex I NADH dehydrogenase is important for cancer cell proliferation. Specifically, NAD+ is necessary for the activities of NAD+‐dependent deacetylases SIRT3 and SIRT7, which suppress the expression of p21Cip1 cyclin‐dependent kinase inhibitor, an antiproliferative molecule, at the translational and transcriptional
Masato Higurashi +5 more
wiley +1 more source
Discrete Mathematics, 1979 AbstractA base of the cycle space of a binary matroid M on E is said to be convex if its elements can be totally ordered in such a way that for every e ε E the set of elements of the base containing e is an interval. We show that a binary matroid is cographic iff it has a convex base of cycles; equivalently, graphic matroids can be represented as ...
openaire +2 more sources
On interval representations of graphs
Discrete Applied Mathematics, 2016 The interval number i ( G ) of a graph G is the least integer i such that G is the intersection graph of sets of at most i intervals of the real line. The local track number l ( G ) is the least integer l such that G is the intersection graph of sets of at most l intervals of the real line and such that two intervals of the same vertex belong to ...
Braga de Queiroz, Aquiles +2 more
openaire +2 more sources
Molecular and functional profiling unravels targetable vulnerabilities in colorectal cancer
Molecular Oncology, Volume 19, Issue 6, Page 1751-1774, June 2025.We used whole exome and RNA‐sequencing to profile divergent genomic and transcriptomic landscapes of microsatellite stable (MSS) and microsatellite instable (MSI) colorectal cancer. Alterations were classified using a computational score for integrative cancer variant annotation and prioritization.
Efstathios‐Iason Vlachavas +15 more
wiley +1 more source
An evolution of interval graphs
Discrete Mathematics, 1990 AbstractWe present a model for random interval graphs which, like the model of Erdös and Rényi, exhibits an evolution from empty graphs to complete graphs. We determine various thresholds, including the common threshold for isolated vertices and connectivity.
openaire +2 more sources
The niche graphs of interval orders [PDF]
Discussiones Mathematicae Graph Theory, 2014 The niche graph of a digraph $D$ is the (simple undirected) graph which has the same vertex set as $D$ and has an edge between two distinct vertices $x$ and $y$ if and only if $N^+_D(x) \cap N^+_D(y) \neq \emptyset$ or $N^-_D(x) \cap N^-_D(y) \neq \emptyset$, where $N^+_D(x)$ (resp. $N^-_D(x)$) is the set of out-neighbors (resp. in-neighbors) of $x$ in
Yoshio Sano, Jeongmi Park
openaire +3 more sources
Molecular Oncology, EarlyView.Low expression of five purine metabolism‐related genes (ADSL, APRT, ADCY3, NME3, NME6) was correlated with poor survival in colorectal cancer. Immunohistochemistry analysis showed that low NME3 (early stage) and low ADSL/NME6 (late stage) levels were associated with high risk.
Sungyeon Kim +8 more
wiley +1 more source
Signed interval graphs and bigraphs: A generalization of interval graphs and bigraphs
, 2022 In this paper, we define and characterize signed interval graphs and bigraphs introducing the concept of negative interval. Also we have shown that these classes of graphs are respectively a generalization of well known classes of interval graphs and interval bigraphs.
Das, Ashok Kumar, Paul, Indrajit
openaire +2 more sources