Results 101 to 110 of about 919,306 (297)
A characterization of strongly chordal graphs
Discrete Mathematics, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paul Manuel +2 more
openaire +3 more sources
A Degradable Bioinspired Flier with Aerogel‐Based Colorimetric Sensors for Environmental Monitoring
Advanced Science, EarlyView.Biodegradable fliers are developed inspired by Tipuana tipu samaras, integrating cellulose nanocrystal aerogel (CNCa) sensors loaded with natural dyes for pH and ammonia detection. The lightweight, degradable fliers mimic natural morphology and aerodynamics, offering an eco‐friendly, scalable solution for in situ environmental monitoring after passive ...
Gianpaolo Gallo +4 more
wiley +1 more source
On the cover ideals of chordal graphs [PDF]
TURKISH JOURNAL OF MATHEMATICS, 2019 The independence complex of a chordal graph is known to be shellable due to a result of Van Tuyl and Villarreal. This is equivalent to the fact that cover ideal of a chordal graph has linear quotients. We use this result to obtain recursive formulas for the Betti numbers of cover ideals of chordal graphs. Also, we give a new proof of their result which
openaire +4 more sources
Advanced Science, EarlyView.This study establishes a mandibular asymmetry (MA) mouse model that recapitulates chronic orofacial pain and anxiety comorbidity. Anterior cingulate cortex (ACC) hyperactivation and synaptic dysfunction are identified as central neural mechanisms underlying these pathologies, with chemogenetic inhibition of ACC CaMKII+ neurons effectively reversing ...
Zhaoyichun Zhang +19 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
Advanced Science, EarlyView.It is shown that hepatic c‐Fos responds to feeding, altering de novo lipogenesis, glycolysis, and a wide range of steatosis‐associated metabolic signaling pathways. Obesogenic diets cause hepatic c‐Fos overexpression, insulin resistance, and the induction of metabolic reprogramming‐related genes.
Ao Li +8 more
wiley +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