Results 131 to 140 of about 908,928 (292)
Early use of the reinforced concrete in the architecture of the Historicism in Austria–Hungary
Abstract The study examines the early incorporation of reinforced concrete in the architecture of Historicism in Austria–Hungary. Spanning the late 19th to early 20th centuries, the research illuminates the period's stylistic pluralism and the transformative impact of reinforced concrete.
Éva Lovra, Zoltán Bereczki
wiley +1 more source
Component graphs of vector spaces and zero-divisor graphs of ordered sets
In this paper, nonzero component graphs and nonzero component union graphs of finite-dimensional vector spaces are studied using the zero-divisor graph of a specially constructed 0–1-distributive lattice and the zero-divisor graph of rings.
Nilesh Khandekar+2 more
doaj +1 more source
Multidimensional Research on Hair Loss in Young Chinese Females With Oily Scalps. [PDF]
ABSTRACT Background In recent years, the problem of female alopecia has been increasing and has shown a trend toward youthfulness. However, there are fewer studies on young female alopecia in the existing literature. Aim We aimed to study the possible causes of hair loss in young Chinese females aged 18–35 with oily scalps.
Shao S+5 more
europepmc +2 more sources
Abstract Gerber half‐joints, broadly used in the last century as elements of concrete bridges, are prone to corrosion‐induced deterioration, which may lead to brittle shear collapse. It is of paramount importance to develop advanced numerical models for simulating the collapse behavior of Gerber half‐joints, taking material deterioration into account ...
Dario De Domenico+4 more
wiley +1 more source
Finite groups whose coprime graph is split, threshold, chordal, or a cograph [PDF]
Given a finite group G, the coprime graph of G, denoted by Î(G), is defined as an undirected graph with the vertex set G, and for distinct x, y â G, x is adjacent to y if and only if (o(x), o(y)) = 1, where o(x) and o(y) are the orders of x and y ...
Jin Chen, Shixun Lin, Xuanlong Ma
doaj +1 more source
Unique Perfect Phylogeny Characterizations via Uniquely Representable Chordal Graphs
The perfect phylogeny problem is a classic problem in computational biology, where we seek an unrooted phylogeny that is compatible with a set of qualitative characters.
Gysel, Rob
core
On powers and centers of chordal graphs
AbstractA graph is chordal if every cycle of length strictly greater than three has a chord. A necessary and sufficient condition is given for all powers of a chordal graph to be chordal. In addition, it is shown that for connected chordal graphs the center (the set of all vertices with minimum eccentricity) always induces a connected subgraph.
Renu C. Laskar, Douglas R. Shier
openaire +3 more sources
ABSTRACT The ongoing invasion of the zoonotic parasite Angiostrongylus cantonensis threatens humans, other mammals, and birds. In Mallorca, neurological disorders associated with this parasite are increasingly reported in free‐living Algerian hedgehogs, Atelerix algirus, raising public health concerns.
Anna Šipková+7 more
wiley +1 more source
The Hippo pathway transcription factor TEAD3 represents an independent prognostic biomarker of tumor recurrence and a potential therapeutic vulnerability through its regulation of cholesterol metabolism in glioma. Abstract Glioblastomas represent the most common and lethal primary brain tumors in the world.
Konstantin Masliantsev+10 more
wiley +1 more source
A New Characterization of Unichord-Free Graphs
Unichord-free graphs are defined as having no cycle with a unique chord. They have appeared in several papers recently and are also characterized by minimal separators always inducing edgeless subgraphs (in contrast to characterizing chordal graphs by ...
McKee Terry A.
doaj +1 more source