Results 41 to 50 of about 453 (193)
Strongly Chordal Graph Generation using Intersection Graph Characterisation
CoRR, 2019 Strongly chordal graphs are a subclass of chordal graphs. Farber also established a number of different characterisations for this class of graphs. These include an intersection graph characterisation that is analogous to a similar characterisation for chordal graphs. Seker et al. exploited this characterisation of chordal graphs to obtain an algorithm
Md. Zamilur Rahman, Asish Mukhopadhyay
openaire +2 more sources
Independence complexes of strongly orderable graphs
, 2022 We prove that for any finite strongly orderable (generalized strongly chordal) graph G, the independence complex Ind(G) is either contractible or homotopy equivalent to a wedge of spheres of dimension at least bp(G)−1, where bp(G) is the biclique vertex ...
Yetim, Mehmet Akif
core +1 more source
Developmental Dynamics, EarlyView.Abstract Background Fibrillins provide a scaffold for elastic fiber formation, which enables lung recoil and aortic compliance. Abnormal fibrillin microfibrils, as in Marfan syndrome, lead to enlarged alveoli, vascular stiffening, and aneurysms. Our earlier studies suggested that fibrillin function depends on O‐glucosylation of its epidermal growth ...
Sanjiv Neupane +4 more
wiley +1 more source
iMetaOmics, EarlyView.This schematic illustrates how probiotics‐derived postbiotics (PLBK®1–5) combat high‐fat diet‐induced obesity. Postbiotics remodel gut microbiota, boosting beneficial metabolites. These metabolites activate adipocyte thermogenesis (Ucp1/AMPK pathway), resulting in reduced body weight, improved insulin sensitivity, and alleviated hepatic steatosis in ...
Ye Tian +7 more
wiley +1 more source
On minimally tough chordal graphs
, 2023 Katona and Varga showed that for any rational number $t \in (1/2,1]$, no chordal graph is minimally $t$-tough. We conjecture that no chordal graph is minimally $t$-tough for $t>1/2$ and prove several results supporting the conjecture.
Varga, Kitti +4 more
core
iMetaOmics, EarlyView.Genome surveillance across a swine‐associated One Health continuum in China shows that slaughterhouses act as major enrichment nodes for tet(X4)‐mediated tigecycline resistance, driven by putative clonal transmission and stable plasmid backbones. Integrating global datasets enables lineage‐specific risk stratification, highlighting key control points ...
Qin Wang +10 more
wiley +1 more source
All-pairs-shortest-length on strongly chordal graphs
Discrete Applied Mathematics, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
V. Balachandhran, C. Pandu Rangan
openaire +1 more source
, 2003 Although chordal graphs may seem at first to be a poor choice to approach using cycle/cutset graph duality, portions of chordal graph theory can be successfully dualized within the context of nonseparable 3-edge-connected graphs.
McKee, Terry A.
core +1 more source
Stable Cuts, NAC‐Colourings and Flexible Realisations of Graphs
Journal of Graph Theory, EarlyView.ABSTRACT A (2‐dimensional) realisation of a graph G $G$ is a pair ( G , p ) $(G,p)$, where p $p$ maps the vertices of G $G$ to R 2 ${{\mathbb{R}}}^{2}$. A realisation is flexible if it can be continuously deformed while keeping the edge lengths fixed, and rigid otherwise.
Katie Clinch +5 more
wiley +1 more source
Chordal bipartite completion of colored graphs
, 2007 Golumbic, Kaplan, and Shamir [Graph sandwich problems, J. Algorithms 19 (1995) 449–473], in their paper on graph sandwich problems published in 1995, left the status of the sandwich problems for strongly chordal graphs and chordal bipartite graphs open ...
R. Sritharan, Sritharan, R.
core +1 more source