Results 71 to 80 of about 908,928 (292)
Inheritance principles for chordal graphs
Linear Algebra and its Applications, 1991 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tiberiu Constantinescu, Mihai Bakonyi
openaire +3 more sources
Generating subgraphs in chordal graphs
Discrete Applied Mathematics, 2023 13 pages, 1 figure.
Vadim E. Levit, David Tankus
openaire +2 more sources
Molecular Oncology, EarlyView.This study explores salivary RNA for breast cancer (BC) diagnosis, prognosis, and follow‐up. High‐throughput RNA sequencing identified distinct salivary RNA signatures, including novel transcripts, that differentiate BC from healthy controls, characterize histological and molecular subtypes, and indicate lymph node involvement.
Nicholas Rajan +9 more
wiley +1 more source
On the shelling antimatroids of split graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 Chordal graph shelling antimatroids have received little attention with regard to their combinatorial properties and related optimization problems, as compared to the case of poset shelling antimatroids.
Jean Cardinal +2 more
doaj +1 more source
Discrete Applied Mathematics, 2002 A chordally signed graph is defined as a signed chordal graph (each edge is designated as being positive or negative and every induced cycle is a triangle) in which every cycle \(C\) containing an even number of negative edges (positive cycles) has a chord \(e\) such that \(C\cup\{e\}\) forms two positive cycles.
openaire +2 more sources
Advanced Biology, EarlyView.The unrolling of the peltate leaves in Syngonium podophyllum is analyzed and quantified (left‐hand side to center). These measurements serve to verify a mathematical model for leaf unrolling based on the model used in Schmidt (2007). An additional formula for obtaining a layer mismatch from a prescribed radius is derived.
Michelle Modert +4 more
wiley +1 more source
3-Colourability of Dually Chordal Graphs in Linear Time [PDF]
, 2012 A graph G is dually chordal if there is a spanning tree T of G such that any maximal clique of G induces a subtree in T. This paper investigates the Colourability problem on dually chordal graphs.
Leitert, Arne
core
Advanced Science, EarlyView.Treatment of MPTP‐incubated cells with NAD+‐boosters increase the UPRmt/mitophagy‐related mitochondria quality control (MQC). Disturbed plasma UPRmt‐mitophagy‐mediated MQC profiles in PD patient samples. NMN inhibits motor deficit and forestalls neuropathology phenotypes of PD mice, which is required the atf4‐medicated UPRmt pathway.
Shuoting Zhou +16 more
wiley +1 more source
The Hadwiger number, chordal graphs and -perfection
AKCE International Journal of Graphs and Combinatorics, 2017 A graph is chordal if every induced cycle has three vertices. The Hadwiger number is the order of the largest complete minor of a graph. We characterize the chordal graphs in terms of the Hadwiger number and we also characterize the families of graphs ...
Christian Rubio-Montiel
doaj +1 more source
On an edge partition and root graphs of some classes of line graphs
Electronic Journal of Graph Theory and Applications, 2017 The Gallai and the anti-Gallai graphs of a graph $G$ are complementary pairs of spanning subgraphs of the line graph of $G$. In this paper we find some structural relations between these graph classes by finding a partition of the edge set of the line ...
K Pravas, A. Vijayakumar
doaj +1 more source