Results 71 to 80 of about 34,901 (303)
A new bound for the 2/3 conjecture [PDF]
, 2012 We show that any n-vertex complete graph with edges coloured with three colours contains a set of at most four vertices such that the number of the neighbours of these vertices in one of the colours is at least 2n/3.
Sereni, Jean-Sébastien +10 more
core +1 more source
Polymorph‐Specific Electronic Transduction in WO3 during Molecular Sensing
Advanced Materials, EarlyView.Metal‐oxide polymorphs with similar surface chemistry can nevertheless exhibit distinct sensing properties. In γ‐ and ε‐WO3, analyte adsorption appears comparable; yet, only ε‐WO3 induces a pronounced lattice electronic perturbation that accommodates charge in sub‐conduction band minimum states.
Matteo D'Andria +6 more
wiley +1 more source
Advanced Materials, EarlyView.The energetic offset between the donor and the acceptor components in organic photoactive layers is central to the tradeoff between photovoltage and photocurrent losses. This Perspective covers the most important issues surrounding this topic in non‐fullerene acceptor blends, from the difficulty of accurately determining state energies and driving ...
Dieter Neher, Manasi Pranav
wiley +1 more source
Transactions on Environment and Electrical Engineering, 2016 Dissolved gas-in-oil analysis (DGA) is a sensitive and reliable technique for the detection of incipient fault condition within oil-immersed transformers. When the mineral oil is subjected to high thermal or/and electrical stresses, it decomposes and, as
Sobhy Serry Dessouky +3 more
doaj +1 more source
Weak edge triangle free detour number of a graph
Electronic Journal of Graph Theory and Applications, 2022 For any two vertices u and v in a connected graph G = (V, E), a u − v path P is called a u − v triangle free path if no three vertices of P induce a triangle. The triangle free detour distance D△f(u, v) is the length of a longest u − v triangle free path
Sethu Ramalingam, S. Athisayanathan
doaj +1 more source
Advanced Materials, EarlyView.Mechanically origami‐coded 3D kirigami photovoltaics convert a single extension–release cycle into deterministic self‐folding, reconfiguring planar solar cells into programmable 3D modules. Distinct coding strategies enable either ultrahigh stretchability (500% system strain) or ultrahigh initial effective areal coverage (225%).
Seok Joon Hwang +15 more
wiley +1 more source
Advanced Materials, EarlyView.The miscibility of foreign elements in rutile‐type IrO2 and SnO2 is greatly enhanced under high Laplace pressure, where their crystal size is reduced to the nanoscale. This enhancement leads to the successful synthesis of DSA‐composition solid‐solution nanocatalysts with notable durability during the acidic OER in water electrolysis.
Chang Hyun Park +7 more
wiley +1 more source
Mathematics OpenThe cycle graph of a graph G is the graph [Formula: see text] whose vertices are the induced cycles of G and where two vertices are adjacent if and only if they are distinct induced cycles that share a common edge.
Severino V. Gervacio, Yvette F. Lim
doaj +1 more source
First reformulated Zagreb indices of some classes of graphs
Karpatsʹkì Matematičnì Publìkacìï, 2018 A topological index of a graph is a parameter related to the graph; it does not depend on labeling or pictorial representation of the graph. Graph operations plays a vital role to analyze the structure and properties of a large graph which is derived ...
V. Kaladevi +2 more
doaj +1 more source
Discrete Mathematics & Theoretical Computer Science, 2019 Slimness of a graph measures the local deviation of its metric from a tree metric. In a graph $G=(V,E)$, a geodesic triangle $\bigtriangleup(x,y,z)$ with $x, y, z\in V$ is the union $P(x,y) \cup P(x,z) \cup P(y,z)$ of three shortest paths connecting ...
Feodor F. Dragan, Abdulhakeem Mohammed
doaj +1 more source