Results 71 to 80 of about 10,951 (224)

Lactylation Reprogramming in the Bone Infection Microenvironment Identifies PGK1 K361 as a Potential Therapeutic Target for Osteogenic Dysfunction

Advanced Science, EarlyView.
Staphylococcus aureus (S. aureus) infection creates a high‐lactate microenvironment, promoting p300‐mediated lactylation of PGK1 at lysine 361 (K361). Lactylated PGK1 translocates to the mitochondrial outer membrane and interacts with VDAC3. This interaction triggers FtMt downregulation, iron accumulation, and excessive PINK1/Parkin‐mediated mitophagy,
Han‐jun Qin, Si‐ying He, Ting‐hui Xiao, Da‐mao Dai, Xin‐jia Hu, Nan Jiang   +5 more
wiley   +1 more source

Simultaneously dominating all spanning trees of a graph

Electronic Journal of Graph Theory and Applications, 2022
We investigate the problem of simultaneously dominating all spanning trees of a given graph. We prove that on 2-connected graphs, a subset of the vertices dominates all spanning trees of the graph if and only if it is a vertex cover.
Sebastian Johann, Sven O. Krumke, Manuel Streicher   +2 more
doaj   +1 more source

Partitioning Chordal Graphs

Electronic Notes in Discrete Mathematics, 2011
Matrix partition problems generalize graph colouring and homomorphism problems and occur frequently in the study of perfect graphs. It is difficult to decide, even for a small matrix M, whether the M-partition problem is polynomial time solvable or NP-complete (or possibly neither), and whether M-partitionable graphs can be characterized by a finite ...
Tomás Feder, Pavol Hell, Shekoofeh Nekooei Rizi   +2 more
openaire   +1 more source

Clique Graphs of Chordal and Path Graphs [PDF]

SIAM Journal on Discrete Mathematics, 1994
Clique graphs of chordal and (undirected) path graphs are characterized. The clique graph of a graph \(G\) is the intersection graph of maximal cliques of \(G\). A chordal graph is the intersection graph of subtrees of a tree. A path graph is the intersection graph of paths of a tree. (Given a family \(F\) of subsets, the intersection graph of \(F\) is
Szwarcfiter, Jayme L., Bornstein, Claudson F.   +1 more
openaire   +2 more sources

On Hyper-Chordal graphs [PDF]

Carpathian Journal of Mathematics, 2021
Triangulated graphs have many interesting properties (perfection, recognition algorithms, combinatorial optimization algorithms with linear complexity). Hyper-triangulated graphs are those where each induced subgraph has a hyper-simplicial vertex. In this paper we give the characterizations of hyper-triangulated graphs using an ordering of vertices and
openaire   +1 more source

Advancing mine pillar design: Evaluating traditional methods and integrating AI for enhanced stability of pillars in the Great Dyke, Zimbabwe

Deep Underground Science and Engineering, EarlyView.
B1 is bord width 1, B2 is bord width 2, L is the pillar length, W is the pillar width, red color and letter A represent the pillars, and white color and number 1 represent excavated areas. Pstress is the average pillar stress; σv is the vertical component of the virgin stress, MPa; and e is the areal extraction ratio. e = B o B o + B P ${\rm{e}}=\frac{{
Tawanda Zvarivadza, Hendrik Grobler, Peter Apata Olubambi, Moshood Onifade, Manoj Khandelwal   +4 more
wiley   +1 more source

A new method for computing the vertex PI index with applications to special classes of graphs

AKCE International Journal of Graphs and Combinatorics
The Padmakar-Ivan (PI) index of a graph G is given by [Formula: see text], where [Formula: see text] is the number of equidistant vertices for the edge e.
S. C. Manju, K. Somasundaram, Yilun Shang   +2 more
doaj   +1 more source

Learning Inclusion-Optimal Chordal Graphs

, 2008
Appears in Proceedings of the Twenty-Fourth Conference on Uncertainty in Artificial Intelligence (UAI2008)
Auvray, Vincent, Wehenkel, Louis
openaire   +3 more sources

Differential sensitivity of midline development to mitosis during and after primitive streak extension

Developmental Dynamics, EarlyView.
Abstract Background Midline establishment is a fundamental process during early embryogenesis for Bilaterians. Midline morphogenesis in non‐amniotes can occur without mitosis, through Planar Cell Polarity (PCP) signaling. By contrast, amniotes utilize both cellular processes for developing the early midline landmark, the primitive streak (PS).
Zhiling Zhao, Rieko Asai, Takashi Mikawa
wiley   +1 more source

Chordal multipartite graphs and chordal colorings

Discrete Mathematics, 2007
A graph is defined to be chordal colorable if it admits a proper vertex-coloring such that each minimal separator induces a subgraph in which two vertices are adjacent if and only if they are differently colored. All chordal graphs and all chordal bipartite graphs are chordal colorable. All chordal colorable graphs are weakly chordal.
openaire   +1 more source