Results 101 to 110 of about 55,028 (193)

Dominating cliques in chordal graphs

, 1994
A chordal graph has a dominating clique iff it has diameter at most 3. A strongly chordal graph which has a dominating clique has one as small as the smallest dominating set—and, furthermore, there is a linear-time algorithm to find such a small ...
Damaschke, Peter, Lubiw, Anna, Kratsch, Dieter   +2 more
core   +1 more source

RNA Metabolism Genes as Prognostic Biomarkers and Therapeutic Targets in Colorectal Cancer Based on the Analysis of Single‐Cell and Bulk‐RNA Sequencing Data

Journal of Cellular and Molecular Medicine, Volume 30, Issue 11, June 2026.
ABSTRACT Colorectal cancer (CRC) is one of the most common malignancies worldwide and remains a major cause of cancer‐related mortality. Increasing evidence suggests that aberrant RNA metabolism contributes to tumour initiation, progression and therapeutic resistance.
Fandong Kong, Xuewei Zhang, Shuguang Su, Feilong Chen, Qiantao Ye, Ronghua Yang, Hanpeng Du   +6 more
wiley   +1 more source

Efficient parallel algorithm to compute a doubly perfect elimination ordering of a doubly chordal graph

, 2005
The class of doubly chordal graphs, which is a subclass of chordal graphs and a superclass of strongly chordal graphs, arises in many application areas.
Radhakrishnan, Sridhar, Lee, Mahnhoon
core   +1 more source

Gallic Acid‐Responsive microRNAs Reprogram Lignification During Drought Acclimation Process in Spearmint

Plant Biotechnology Journal, Volume 24, Issue 6, Page 4263-4281, June 2026.
ABSTRACT Mentha spicata L. (spearmint) is a high‐value aromatic and medicinal species, whose productivity is strongly affected by water deficit. Nevertheless, the molecular mechanisms underlying drought acclimation in this mint remain largely unexplored. Thus, here, we investigated the microRNA‐mediated regulatory processes triggered in M.
Alessia D'Agostino, Gabriele Di Marco, Gerardo Pepe, Adelaide Teofani, Chiara Pontecorvi, Manuela Helmer‐Citterich, Antonella Canini, Angelo Gismondi   +7 more
wiley   +1 more source

Thurston norm for coherent right‐angled Artin groups via L2$L^2$‐invariants

Journal of Topology, Volume 19, Issue 2, June 2026.
Abstract We define a new notion of splitting complexity for a group G$G$ along a non‐trivial integral character ϕ∈H1(G;Z)$\phi \in H^1(G; \mathbb {Z})$. If G$G$ is a one‐ended coherent right‐angled Artin group, we show that the splitting complexity along an epimorphism ϕ:G→Z$\phi \colon G \rightarrow \mathbb {Z}$ equals the L2$L^2$‐Euler characteristic
Monika Kudlinska
wiley   +1 more source

Symmetry properties of chordal rings of degree 3

, 2003
This paper presents the main properties of chordal rings of degree 3. This family of graphs is strongly related to circulant graphs, which are actually often called chordal rings too. The use of triangles in the plane to represent the vertices allows one
Lali Barriere, Barrière, Lali
core   +1 more source

Selected Papers of the 31st International Workshop on Combinatorial Algorithms, IWOCA 2020. [PDF]

Algorithmica, 2022
Gąsieniec L, Klasing R, Radzik T.
europepmc   +1 more source

Dependency Structures in Cryptocurrency Market from High to Low Frequency. [PDF]

Entropy (Basel), 2022
Briola A, Aste T.
europepmc   +1 more source

Maximum Vertex-Weighted Matching in Strongly Chordal Graphs

, 2008
Given a graph G = (V; E) and a real weight for each vertex of G, the vertex-weight of a matching is defined to be the sum of the weights of the vertices covered by the matching.
Sulamita Klein, Manoel B. Campelo Neto
core  

Hendry\u27s Conjecture on Chordal Graph Subclasses

, 2017
A cycle is extendable if there exists another cycle on the same set of vertices plus one more vertex. G.R.T. Hendry conjectured (1990) that every non spanning cycle in a Hamiltonian chordal graph is extendable.

core