Results 51 to 60 of about 151,154 (334)
Advanced Engineering Materials, EarlyView.This study investigates laser shock peening for enhancing fatigue performance of riveted aerospace aluminum joints. A comparative approach with cold expansion combines fatigue testing and synchrotron X‐ray methods. Integrating mechanical testing with residual stress and strain characterization provides insights into how different treatments affect the ...
Ogün Baris Tapar +6 more
wiley +1 more source
Non-planar one-loop Parke-Taylor factors in the CHY approach for quadratic propagators
Journal of High Energy Physics, 2018 In this work we have studied the Kleiss-Kuijf relations for the recently introduced Parke-Taylor factors at one-loop in the CHY approach, that reproduce quadratic Feynman propagators.
Naser Ahmadiniaz +2 more
doaj +1 more source
On edge-intersection graphs of k-bend paths in grids [PDF]
Discrete Mathematics & Theoretical Computer Science, 2010 Edge-intersection graphs of paths in grids are graphs that can be represented such that vertices are paths in a grid and edges between vertices of the graph exist whenever two grid paths share a grid edge. This type of graphs is motivated by applications
Therese Biedl, Michal Stern
doaj +1 more source
Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs [PDF]
, 2013 A graph is called a strong (resp. weak) bar 1-visibility graph if its vertices can be represented as horizontal segments (bars) in the plane so that its edges are all (resp.
Evans, William +5 more
core
Distributed Dominating Set Approximations beyond Planar Graphs
, 2019 The Minimum Dominating Set (MDS) problem is one of the most fundamental and challenging problems in distributed computing. While it is well-known that minimum dominating sets cannot be approximated locally on general graphs, over the last years, there ...
Amiri, Saeed Akhoondian +2 more
core +1 more source
Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm [PDF]
, 2018 Given an undirected graph and two disjoint vertex pairs $s_1,t_1$ and $s_2,t_2$, the Shortest two disjoint paths problem (S2DP) asks for the minimum total length of two vertex disjoint paths connecting $s_1$ with $t_1$, and $s_2$ with $t_2$, respectively.
Björklund, Andreas, Husfeldt, Thore
core +3 more sources
Advanced Engineering Materials, EarlyView.An idea of designing novel sensors is proposed by creating appropriate Schottky barriers and vacancies between isomorphous Core‐CuOii/ Shell‐CuOi secondary microspheres and enhancing catalytic and spill‐over effects, and electronegativity via spontaneous biphasic separation, self‐assembly, and trace‐Ni‐doping.
Bala Ismail Adamu +8 more
wiley +1 more source
Light Graphs In Planar Graphs Of Large Girth
Discussiones Mathematicae Graph Theory, 2016 A graph H is defined to be light in a graph family 𝒢 if there exist finite numbers φ(H, 𝒢) and w(H, 𝒢) such that each G ∈ 𝒢 which contains H as a subgraph, also contains its isomorphic copy K with ΔG(K) ≤ φ(H, 𝒢) and ∑x∈V(K) degG(x) ≤ w(H, 𝒢).
Hudák Peter +3 more
doaj +1 more source
Journal of Combinatorial Theory, Series B, 1973 AbstractAn F-planar graph, where F is an ordered field, is a graph that can be represented in the plane F × F, with non-crossing line segments as edges. It is shown that the graph G is F-planar for some F if and only if every finite subgraph of G is planar.
openaire +2 more sources
On edge-group choosability of graphs [PDF]
, 2011 In this paper, we study the concept of edge-group choosability of graphs. We say that G is edge k-group choosable if its line graph is k-group choosable. An edge-group choosability version of Vizing conjecture is given.
Khamseh, Amir, Omidi, Gholamreza
core