Results 101 to 110 of about 58,065 (305)
Decomposition of Complete graphs into Triangles and Claws
, 2015 Let Kn be a complete graph with n vertices, Ck denote a cycle of length k, and Sk denote a star with k edges. If k=3, then we call C3 a triangle and S3 a claw.
Fu, Chin-Mei; Lin, Yuan-Lung; Lo, Shu-Wen; Hsu, Yu-Fong +1 more
core +1 more source
Advanced Materials, EarlyView.This review summarizes the principles and challenges of nonaqueous lithium‐oxygen batteries and recent advances in cathode catalysts, including carbon‐based materials, metals, oxides, sulfides, nitrides, carbides, and redox mediators. It highlights emerging design strategies and artificial intelligence‐driven approaches, emphasizing data‐assisted ...
Yuqing Yao +8 more
wiley +1 more source
Minimum H-decompositions of graphs
Journal of Combinatorial Theory, Series B, 2007 Given graphs \(G\) and \(H\), an \(H\)-decomposition of \(G\) is a partition of the edge set of \(G\) such that each part is either a single edge or forms a graph isomorphic to \(H\). Let \(\varphi_H(n)\) be the smallest number \(\varphi\) such that any graph \(G\) of order \(n\) admits an \(H\)-decomposition with at most \(\varphi\) parts.
Oleg Pikhurko, Teresa Sousa
openaire +1 more source
Advanced Materials Technologies, EarlyView.A mask‐free and cost‐effective UV‐pico‐second laser‐based microfabrication method is proposed to fabricate large‐area biodegradable microelectrode arrays and pressure sensors. These devices demonstrate low impedance, good conformability, excellent biocompatibility, and rapid degradation, providing a new route for next‐generation transient electronics ...
Bhavani Prasad Yalagala +5 more
wiley +1 more source
On double-star decomposition of graphs
Discussiones Mathematicae Graph Theory, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Saieed Akbari +3 more
openaire +2 more sources
A new decomposition theorem for Berge graphs [PDF]
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seymour and Thomas proved a decomposition theorem for Berge graphs saying that ...
Nicolas Trotignon
core
An example of graph tree decomposition.
, 2015 (a) a graph; (b) a tree decomposition of the graph in (a).
Yinglei Song (523490) +1 more
core +1 more source
Advanced Materials Technologies, EarlyView.Transducers convert physical signals into electrical and optical representations, yet each mechanism is bounded by intrinsic trade‐offs across bandwidth, sensitivity, speed, and energy. This review maps transduction mechanisms across physical scale and frequency, showing how heterogeneous integration and multiphysics co‐design transform isolated ...
Aolei Xu +8 more
wiley +1 more source
Spectral Complexity of Directed Graphs and Application to Structural Decomposition
Complexity, 2019 We introduce a new measure of complexity (called spectral complexity) for directed graphs. We start with splitting of the directed graph into its recurrent and nonrecurrent parts.
Igor Mezić +3 more
doaj +1 more source
Parametric Multi-Step Scheme for GPU-Accelerated Graph Decomposition into Strongly Connected Components [PDF]
, 2017 The problem of decomposing a directed graph into strongly connected components (SCCs) is a fundamental graph problem that is inherently present in many scientific and commercial applications. Clearly, there is a strong need for good high-performance, e.g.
ALDEGHERI, STEFANO +9 more
core +1 more source