Results 21 to 30 of about 120,514 (220)
V‐notched rail shear test applied to geopolymer composites
Journal of the American Ceramic Society, Volume 106, Issue 2, Page 1260-1272, February 2023., 2023 Abstract This work presents a systematic study of the shear properties of a potassium‐based geopolymer reinforced with distinct types of fibers. Chopped basalt reinforcements in lengths from 3 mm up to 50 mm and 13 μm in diameter were compared with thicker 20‐mm length, basalt mini bars, sand‐coated basalt mini rods, and steel fibers.
Ana C. C. Trindade +2 more
wiley +1 more source
自余弱弦图(On self-complementary weakly chordal graphs)
Zhejiang Daxue xuebao. Lixue ban, 2010 The class of self-complementary (sc) weakly chordal graphs is studied, which is a generalization of self-complementary chordal graphs, lower and upper bounds for the number of two-pairs in sc weakly chordal graphs have been obtained.
MERAJUDDIN() +3 more
doaj +1 more source
Computing a Clique Tree with the Algorithm Maximal Label Search
Algorithms, 2017 The algorithm MLS (Maximal Label Search) is a graph search algorithm that generalizes the algorithms Maximum Cardinality Search (MCS), Lexicographic Breadth-First Search (LexBFS), Lexicographic Depth-First Search (LexDFS) and Maximal Neighborhood Search (
Anne Berry, Geneviève Simonet
doaj +1 more source
Representations of Edge Intersection Graphs of Paths in a Tree [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Let $\mathcal{P}$ be a collection of nontrivial simple paths in a tree $T$. The edge intersection graph of $\mathcal{P}$, denoted by EPT($\mathcal{P}$), has vertex set that corresponds to the members of $\mathcal{P}$, and two vertices are joined by an ...
Martin Charles Golumbic +2 more
doaj +1 more source
Orthopaedic Surgery, Volume 14, Issue 12, Page 3322-3329, December 2022., 2022 The tibia is simplified as a two‐dimensional graph, The lower extremities were in an unnatural state within one year after TKA. The changes of the lower extremities force line were actually the common results of the gradual adaptation of the lower extremities to TKA and the lateral swing of the extremities 3° after surgery.
Long Cheng +6 more
wiley +1 more source
Complexity of Hamiltonian Cycle Reconfiguration
Algorithms, 2018 The Hamiltonian cycle reconfiguration problem asks, given two Hamiltonian cycles C 0 and C t of a graph G, whether there is a sequence of Hamiltonian cycles C 0 , C 1 , … , C t such that C i can be obtained ...
Asahi Takaoka
doaj +1 more source
Bayesian analysis of social influence
Journal of the Royal Statistical Society: Series A (Statistics in Society), Volume 185, Issue 4, Page 1855-1881, October 2022., 2022 Abstract The network influence model is a model for binary outcome variables that accounts for dependencies between outcomes for units that are relationally tied. The basic influence model was previously extended to afford a suite of new dependence assumptions and because of its relation to traditional Markov random field models it is often referred to
Johan Koskinen, Galina Daraganova
wiley +1 more source
Maxclique and Unit Disk Characterizations of Strongly Chordal Graphs
Discussiones Mathematicae Graph Theory, 2014 Maxcliques (maximal complete subgraphs) and unit disks (closed neighborhoods of vertices) sometime play almost interchangeable roles in graph theory. For instance, interchanging them makes two existing characterizations of chordal graphs into two new ...
Caria Pablo De, McKee Terry A.
doaj +1 more source
On chordality of the power graph of finite groups [PDF]
arXiv, 2022 A graph is called chordal if it forbids induced cycles of length 4 or more. In this paper, we attempt to identify the non-nilpotent groups whose power graph is a chordal graph (this question was raised by Cameron in [4]). In this direction, we characterise the direct product of finite groups having chordal power graphs.
arxiv
Semi-strict chordality of digraphs [PDF]
arXiv, 2022 Chordal graphs are important in algorithmic graph theory. Chordal digraphs are a digraph analogue of chordal graphs and have been a subject of active studies recently. Unlike chordal graphs, chordal digraphs lack many structural properties such as forbidden subdigraph or representation characterizations.
arxiv