Results 81 to 90 of about 10,951 (224)
Finite Element Modelling of Rocking and Hybrid Precast Walls under Seismic Loading
ABSTRACT In recent years, self‐centring systems have received considerable research interest in the seismic design of precast concrete structures for their ability to limit damage and satisfy resilience requirements. Rocking and hybrid structural walls, characterised by the formation of a single gap at the wall–foundation interface, mitigate damage by ...
Andrea Belleri +3 more
wiley +1 more source
The Topological Connectivity of the Independence Complex of Circular-Arc Graphs
Let us denoted the topological connectivity of a simplicial complex $C$ plus 2 by $\eta(C)$. Let $\psi$ be a function from class of graphs to the set of positive integers together with $\infty$. Suppose $\psi$ satisfies the following properties: \newline
Yousef Abd Algani
doaj +1 more source
The leafage of a chordal graph
The leafage l(G) of a chordal graph G is the minimum number of leaves of a tree in which G has an intersection representation by subtrees. We obtain upper and lower bounds on l(G) and compute it on special classes.
Lin, In-Jen +2 more
core +3 more sources
Distance Approximating Trees for Chordal and Dually Chordal Graphs [PDF]
Summary: We show that, for each chordal graph \(G\), there is a tree \(T\) such that \(T\) is a spanning tree of the square \(G^2\) of \(G\) and, for every two vertices, the distance between them in \(T\) is not larger than the distance in \(G\) plus 2.
Brandstädt, Andreas +2 more
openaire +2 more sources
This paper aims to provide a robust design approach for HAWTs operating in shear flow. This study fills a critical research gap by integrating BEM and vortex theories for blade design in non‐homogeneous inflow conditions. The authors of the paper made an effort to develop and test an experimentally unsophisticated model of a turbine working in shear ...
Agnieszka Dorota Woźniak +2 more
wiley +1 more source
On a Class of Graphs with Large Total Domination Number [PDF]
Let $\gamma(G)$ and $\gamma_t(G)$ denote the domination number and the total domination number, respectively, of a graph $G$ with no isolated vertices. It is well-known that $\gamma_t(G) \leq 2\gamma(G)$.
Selim Bahadır, Didem Gözüpek
doaj +1 more source
Clique trees of infinite locally finite chordal graphs [PDF]
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
This paper studies dual-chordal graphs, that is, graphs that are dual to chordal graphs with regard to cycle/cutset duality. A characteristic of such graphs is that every cutset with at least four edges is accompanied by a certain kind of edge, a ``cut-chord.'' One result allows us to recognize dual-chordal graphs by simply looking at cubic graphs.
openaire +1 more source
Generating Weakly Chordal Graphs from Arbitrary Graphs
We propose a scheme for generating a weakly chordal graph from a randomly generated input graph, G = (V, E). We reduce G to a chordal graph H by adding fill-edges, using the minimum vertex degree heuristic. Since H is necessarily a weakly chordal graph, we use an algorithm for deleting edges from a weakly chordal graph that preserves the weak ...
Khanduja, Sudiksha +3 more
openaire +2 more sources
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

