Results 71 to 80 of about 505,548 (331)
On expansive and anti-expansive tree maps [PDF]
Opuscula Mathematica, 2018 With every self-map on the vertex set of a finite tree one can associate the directed graph of a special type which is called the Markov graph. Expansive and anti-expansive tree maps are two extremal classes of maps with respect to the number of loops in
Sergiy Kozerenko
doaj +1 more source
Matching Preclusion and Conditional Matching Preclusion Problems for Twisted Cubes [PDF]
, 2010 The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. For many interconnection networks, the optimal sets are precisely those induced
Bhaskar, Ram +4 more
core
From Nature to Engineering: Mortar Volume and Interfacial Mechanics in Bioinspired Ceramics
Advanced Engineering Materials, EarlyView.Inspired by natural armors like nacre, this study explores how varying the volume fraction of the soft mortar layer impacts the interfacial strength and toughness of bioinspired ceramics. Experimental and computational analysis reveals that higher mortar volumes increase energy dissipation but reduce interfacial stiffness, offering insights for ...
Ehsan Azad +4 more
wiley +1 more source
Critical perfect graphs and perfect 3-chromatic graphs
Journal of Combinatorial Theory, Series B, 1977 AbstractThis paper builds on results based on D. R. Fulkerson's antiblocking polyhedra approach to perfect graphs to obtain information about critical perfect graphs and related clique-generated graphs. Then we prove that Berge's Strong Perfect Graph Conjecture is valid for 3-chromatic graphs.
openaire +3 more sources
Advanced Engineering Materials, EarlyView.By combining porous, solid, and carbon fiber‐reinforced thermoplastic polyurethane within a single 3D printed honeycomb structure, this current work achieved precise control over spatial stiffness while ensuring strong interlayer adhesion. The findings demonstrate enhanced energy absorption and densification strain, outperforming traditional uniform ...
Savvas Koltsakidis +2 more
wiley +1 more source
Some results on one type of graph family with some special number sequences
AKCE International Journal of Graphs and Combinatorics, 2020 In this study, we introduce a new graph family. Then, we calculate eigenvalues of the adjacency and the Laplacian matrix of this graph family. Moreover, we show that the perfect matching number of this graph family equals to special second order ...
Emrullah Kirklar +2 more
doaj +1 more source
The Windy Postman Problem on Series-Parallel Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 The windy postman problem is the NP-hard problem of finding the minimum cost of a tour traversing all edges of an undirected graph, where the cost of traversal of an edge depends on the direction. Given an undirected graph $G$, we consider the polyhedron
Francisco Javier Zaragoza Martínez
doaj +1 more source
Reconstructibility and perfect graphs
Discrete Mathematics, 1983 AbstractIt is shown that the following classes of graphs are recognizable (i.e. looking at the point-deleted subgraphs of a graph G one can decide whether G belongs to that class or not): (1) perfect graphs, (2) triangulated graphs, (3) interval graphs, (4) comparability graphs, (5) split graphs.Furthermore we show the reconstructibility of (1 ...
openaire +2 more sources
Progress on perfect graphs [PDF]
Mathematical Programming, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Neil Robertson +3 more
openaire +2 more sources
Advanced Engineering Materials, EarlyView.This study reports the fabrication of trabecular bioactive glass scaffolds (composition “1d”: 46.1SiO2‐28.7CaO‐8.8MgO‐6.2P2O5‐5.7CaF2‐4.5Na2O wt%) through vat photopolymerization and the relevant results from mechanical testing and in vivo implantation procedures in rabbit femora, showing great promise for bone tissue engineering applications.
Dilshat Tulyaganov +8 more
wiley +1 more source