Results 91 to 100 of about 11,796 (253)
Chordal Completions of Planar Graphs
Journal of Combinatorial Theory, Series B, 1994 A graph is chordal if there are no induced cycles of length 4 or more. A chordal completion of a graph is formed by adding edges until the resulting graph is chordal. What is the minimal number of edges in a chordal completion? The authors answer this question for the class of planar graphs: every planar graph on \(n\) vertices has a chordal completion
Fan R. K. Chung, David Mumford
openaire +2 more sources
Rapid Communications in Mass Spectrometry, EarlyView.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
Structural Concrete, EarlyView.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
The edge-distinguishing chromatic number of petal graphs, chorded cycles, and spider graphs [PDF]
, 2022 Grant Fickes, Tony W. H. Wong
openalex +1 more source
Large‐scale tests of 50‐year‐old prestressed concrete bridge girders
Structural Concrete, EarlyView.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
Structural Concrete, EarlyView.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
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
On an edge partition and root graphs of some classes of line graphs
Electronic Journal of Graph Theory and Applications, 2017 The Gallai and the anti-Gallai graphs of a graph $G$ are complementary pairs of spanning subgraphs of the line graph of $G$. In this paper we find some structural relations between these graph classes by finding a partition of the edge set of the line ...
K Pravas, A. Vijayakumar
doaj +1 more source
On some special classes of contact $B_0$-VPG graphs
, 2019 A graph $G$ is a $B_0$-VPG graph if one can associate a path on a rectangular grid with each vertex such that two vertices are adjacent if and only if the corresponding paths intersect at at least one grid-point.
Bonomo-Braberman, Flavia +3 more
core
Integer Laplacian eigenvalues of strictly chordal graphs [PDF]
, 2020 Nair Maria Maia de Abreu +2 more
openalex +1 more source