Results 81 to 90 of about 1,215,022 (288)
Failure Localization in Power Systems via Tree Partitions [PDF]
, 2018 Cascading failures in power systems propagate non-locally, making the control and mitigation of outages extremely hard. In this work, we use the emerging concept of the tree partition of transmission networks to provide an analytical characterization of ...
Guo, Linqi +4 more
core +5 more sources
Advanced Engineering Materials, EarlyView.This study examines the mechanical properties of triply periodic minimal surfaces (TPMS)‐based lattices, analyzing 36 architectures in elastic and plastic regimes. It evaluates the applicability of beam‐based scaling laws to TPMS lattices. Rigidity arises from the alignment of members with the load direction and solid regions preventing rotation.
Lucía Doyle +2 more
wiley +1 more source
, 1985 Graph theory is a part of mathematics that has many practical applications. The study of graph theory began in 1736 with Leonard Euler’s work on the Konigsberg bridge problem. Konigsberg was a city built on a river with two islands and seven bridges. The
Tsao, Brenda K.
core +1 more source
The chromatic polynomial of fatgraphs and its categorification [PDF]
, 2006 Motivated by Khovanov homology and relations between the Jones polynomial and graph polynomials, we construct a homology theory for embedded graphs from which the chromatic polynomial can be recovered as the Euler characteristic.
Bar-Natan +29 more
core +8 more sources
Advanced Functional Materials, EarlyView.PBTTT‐OR‐R, a C14‐alkoxy/alkyl‐PBTTT polymer derivative, is of substantial interest for optoelectronics due to its specific fullerene intercalation behavior and enhanced charge‐transfer absorption. Comparing this polymer with (S) and without (O) homocoupling defects reveals that PBTTT‐OR‐R(O) forms stable co‐crystals with PC61BM, while PBTTT‐OR‐R(S ...
Zhen Liu +14 more
wiley +1 more source
Computing all $s$-$t$ bridges and articulation points simplified [PDF]
arXiv, 2020 Given a directed graph $G$ and a pair of nodes $s$ and $t$, an $s$-$t$ bridge of $G$ is an edge whose removal breaks all $s$-$t$ paths of $G$. Similarly, an $s$-$t$ articulation point of $G$ is a node whose removal breaks all $s$-$t$ paths of $G$. Computing the sequence of all $s$-$t$ bridges of $G$ (as well as the $s$-$t$ articulation points) is a ...
arxiv
On perturbations of almost distance-regular graphs [PDF]
Linear Algebra Appl. 435 (2011), 2626-2638, 2012 In this paper we show that certain almost distance-regular graphs, the so-called $h$-punctually walk-regular graphs, can be characterized through the cospectrality of their perturbed graphs. A graph $G$ with diameter $D$ is called $h$-punctually walk-regular, for a given $h\le D$, if the number of paths of length $\ell$ between a pair of vertices $u,v$
arxiv +1 more source
, 2017 The common-mode current is an important indicator with transformerless photovoltaic inverters. However, up to now, there is not an accurate method to predict common-mode current in the inverter design process, resulting from inappropriate device ...
Yangbin Zeng +4 more
semanticscholar +1 more source
The model theory of the curve graph
, 2022 In this paper we develop a bridge between model theory, geometric topology, and geometric group theory. In particular, we investigate the Ivanov Metaconjecture from the point of view of model theory, and more broadly we seek to answer the general ...
Disarlo, Valentina +2 more
core
Nested cycles in large triangulations and crossing-critical graphs [PDF]
, 2009 We show that every sufficiently large plane triangulation has a large collection of nested cycles that either are pairwise disjoint, or pairwise intersect in exactly one vertex, or pairwise intersect in exactly two vertices.
Alon +19 more
core +3 more sources