Results 91 to 100 of about 12,115 (251)
Chordal Completions of Planar Graphs
Journal of Combinatorial Theory, Series B, 1994 A graph is chordal if there are no induced cycles of length 4 or more. A chordal completion of a graph is formed by adding edges until the resulting graph is chordal. What is the minimal number of edges in a chordal completion? The authors answer this question for the class of planar graphs: every planar graph on \(n\) vertices has a chordal completion
Chung, F.R.K., Mumford, D.
openaire +2 more sources
Advanced Science, EarlyView.A multivalent aptamer corona is evolved via established ProteoFish‐SELEX (systematic evolution of ligands by exponential enrichment) for high‐throughput multiplexed detection of multiple cancers. Clinical validation using multivalent aptamer corona demonstrated high accuracy and specificity in multiplexed detection of ovarian, lung, and colorectal ...
Mengjie Wang +10 more
wiley +1 more source
A new construction for vertex decomposable graphs [PDF]
Transactions on Combinatorics, 2016 Let G be a finite simple graph on the vertex set V(G) and let S⊆V(G). Adding a whisker to G at x means adding a new vertex y and edge xy to G where x∈V(G). The graph G∪W(S) is obtained from G by adding a whisker to every vertex of S. We prove that if G∖S
Nasser Hajisharifi, Abolfazl Tehranian
doaj
Discussiones Mathematicae Graph Theory, 2016 We study domination between different types of walks connecting two non-adjacent vertices u and v of a graph (shortest paths, induced paths, paths, tolled walks).
Alcón Liliana
doaj +1 more source
Some structural graph properties of the non-commuting graph of a class of finite Moufang loops
Electronic Journal of Graph Theory and Applications, 2020 For any non-abelian group G, the non-commuting graph of G, Γ=ΓG, is a graph with vertex set G \ Z(G), where Z(G) is the set of elements of G that commute with every element of G and distinct non-central elements x and y of G are joined by an edge if and ...
Hamideh Hasanzadeh Bashir +1 more
doaj +1 more source
Influence of the tie-break rule on the end-vertex problem [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 End-vertices of a given graph search may have some nice properties, as for example it is well known that the last vertex of Lexicographic Breadth First Search (LBFS) in a chordal graph is simplicial, see Rose, Tarjan and Lueker 1976.
Pierre Charbit +2 more
doaj +1 more source
Clique trees of infinite locally finite chordal graphs [PDF]
, 2018 We investigate clique trees of infinite locally finite chordal graphs. Our main contribution is a bijection between the set of clique trees and the product of local finite families of finite trees.
Hofer-Temmel, Christoph, Lehner, Florian
core +1 more source
Advanced Science, EarlyView.Restoration of the mitochondrial Fe–S protein FDX1 suppresses clear cell renal cell carcinoma by coupling ferroptosis with tumor‐intrinsic innate immune activation. FDX1 induces mitochondrial dysfunction and mtDNA/mt‐dsRNA release, activating cGAS–STING and RIG‐I/MDA5–MAVS signaling to elicit type I interferon responses, thereby promoting antigen ...
Xing Huang +13 more
wiley +1 more source
Advanced Science, EarlyView.Uncovering a new layer of translational control, this study reveals how TRMT6/TRMT61A‐mediated tRNA‐m1A methylation drives pro‐tumorigenic senescence in colorectal cancer. By selectively enhancing ARG2 translation, this epitranscriptomic axis triggers an NF‐κB‐dependent SASP.
Tuoyang Li +17 more
wiley +1 more source
Linear time determination of the scattering number for strictly chordal\n graphs [PDF]
, 2021 Lilian Markenzon +1 more
openalex +1 more source