Results 91 to 100 of about 10,361 (216)
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
The Hadwiger number, chordal graphs and -perfection
A graph is chordal if every induced cycle has three vertices. The Hadwiger number is the order of the largest complete minor of a graph. We characterize the chordal graphs in terms of the Hadwiger number and we also characterize the families of graphs ...
Christian Rubio-Montiel
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
ABSTRACT Rationale Ions trapped within a Penning cell (ICR) travel periodic orbits whose frequencies are dependent on their mass‐to‐charge ratio and the value of the magnetic field passing through the trap. Fourier transformation (FT‐ICR) decomposes the signal induced in the detection circuit by the rotation of the ions in the cell after the ...
Patrick Arpino, Michel Heninger
wiley +1 more source
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
Large‐scale tests of 50‐year‐old prestressed concrete bridge girders
Abstract An experimental investigation has been carried out as part of the BRIDGE|50 research project, focusing on large‐scale loading tests performed on five 50‐year‐old prestressed concrete (PC) girders. The study aimed at evaluating the structural response of five girders retrieved from a viaduct in the urban area of Turin, Italy, subjected to 4 ...
Francesco Tondolo +7 more
wiley +1 more source
A chordally signed graph is defined as a signed chordal graph (each edge is designated as being positive or negative and every induced cycle is a triangle) in which every cycle \(C\) containing an even number of negative edges (positive cycles) has a chord \(e\) such that \(C\cup\{e\}\) forms two positive cycles.
openaire +1 more source
Abstract Compression field approaches such as the Cracked Membrane Model with fixed, interlocked cracks (CMM‐F) are efficient tools for the mechanical modeling of reinforced concrete elements, providing the mechanical model σ=fε$$ \boldsymbol{\upsigma} =f\left(\boldsymbol{\upvarepsilon} \right) $$ required for finite element analyses.
Andreas Näsbom +2 more
wiley +1 more source
Vertex partitions of chordal graphs [PDF]
AbstractA k‐tree is a chordal graph with no (k + 2)‐clique. An ℓ‐tree‐partition of a graph G is a vertex partition of G into ‘bags,’ such that contracting each bag to a single vertex gives an ℓ‐tree (after deleting loops and replacing parallel edges by a single edge).
openaire +2 more sources
Pre‐failure behavior of continuous post‐tensioned and post‐grouted beam in case of tendon failure
Abstract Grouted tendons are a common solution for long‐span bridge structures. The grout provides bond and corrosion protection for prestressing steel. However, if the grouting is defective, corrosion of the prestressing steel may initiate and eventually lead to tendon failure.
Olli Asp +2 more
wiley +1 more source

