Results 71 to 80 of about 12,385 (266)
Complement of the generalized total graph of fields
Let R be a commutative ring and H be a multiplicative prime subset of R. The generalized total graph is the undirected simple graph with vertex set R and two distinct vertices x and y are adjacent if For a field F, is the only multiplicative prime subset
T. Tamizh Chelvam, M. Balamurugan
doaj +1 more source
Chlorella vulgaris biorefineries: sustainable biofuels and high‐value carbon capture
Abstract Global reliance on fossil fuels has created urgent economic and environmental challenges, yet large‐scale use of algal biomass remains limited by production costs. Industrial scaling is constrained by inefficient harvesting and the technical challenges of processing recalcitrant cell walls.
Sandyelle Ferreira Alcântara Araújo +13 more
wiley +1 more source
ABSTRACT Index of microcirculatory resistance (IMR) is a cutting‐edge, wire‐based tool that advances the capability assessment of coronary microvascular function. By utilizing distal coronary pressure and mean transit time under maximal hyperemia, IMR delivers consistent, reproducible insights into the microvasculature's dynamic health.
Joanna Sohn +10 more
wiley +1 more source
A hole in a graph is an induced subgraph which is a cycle of length at least four. A graph is chordal if it contains no holes. Following McKee and Scheinerman (1993), we define the chordality of a graph $G$ to be the minimum number of chordal graphs on $V(G)$ such that the intersection of their edge sets is equal to $E(G)$.
Chaniotis, Aristotelis +2 more
openaire +2 more sources
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 +4 more
wiley +1 more source
3-Colourability of Dually Chordal Graphs in Linear Time [PDF]
A graph G is dually chordal if there is a spanning tree T of G such that any maximal clique of G induces a subtree in T. This paper investigates the Colourability problem on dually chordal graphs.
Leitert, Arne
core
On the pathwidth of chordal graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Intersection Graphs of Pseudosegments: Chordal Graphs
We investigate which chordal graphs have a representation as intersection graphs of pseudosegments. For positive we have a construction which shows that all chordal graphs that can be represented as intersection graph of subpaths on a tree are pseudosegment intersection graphs. We then study the limits of representability.
Cornelia Dangelmayr +2 more
openaire +3 more sources
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
A new method for computing the vertex PI index with applications to special classes of graphs
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 +2 more
doaj +1 more source

