Results 91 to 100 of about 58,065 (305)

Graph decompositions

Le Matematiche, 1990
Summary: This paper surveys some recent results and new techniques concerning edge-disjoint decompositions of \(K_ n\) into copies of \(G\), where \(G\) may be a cycle, a path, or just a small graph. Additional properties of such a decomposition are considered, such as nestings, resolvability, \(i\)-perfect decompositions and self-complementary ...
openaire   +2 more sources

Friendship decompositions of graphs

Discrete Mathematics, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Time complexity analysis of generalized decomposition algorithm

, 1997
The time complexity of the fast algorithm for generalized disjunctive decomposition of an rvalued function is studied.The considered algorithm to find the best decomposition is based on the analysis of multiple-terminal multiple-valued decision diagrams.
Pshibytko, V, Kalganova, T
core  

On a class of metrics related to graph layout problems [PDF]

, 2010
We examine the metrics that arise when a finite set of points is embedded in the real line, in such a way that the distance between each pair of points is at least 1.
Theis, D O, Seitz, Hanna, Hanna Seitz, Adam N. Letchford, Seitz, H, Dirk Oliver Theis, Theis, Dirk, Letchford, Adam N., Reinelt, Gerhard, Reinelt, G, Letchford, Adam A.N., Gerhard Reinelt, Letchford, A N, Theis, Dirk Oliver   +13 more
core   +1 more source

When Poor Exciton Dissociation Limits Photocurrents in Organic Solar Cells: Why Low Offset Non‐Fullerene Acceptor Blends Can't Be Efficient

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

Ordinals and graph decompositions

Annals of Pure and Applied Logic, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Decomposing 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 old 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  

Resistance to Overdoping Allows Over 2000 S cm−1 Conductivity in P(g3BTTT) With Anion‐Exchange Doping

Advanced Materials, EarlyView.
Anion‐exchange doping of conjugated polymers is an effective way to achieve high conductivities. Here, we report over 2000 S cm−1 electrical conductivity for doped P(g3BTTT). In addition, we show that P(g3BTTT) sustains exceptionally high doping levels without any drop in the charge mobility.
Basil Hunger, Maximilian M. Horn, Eva Röck, Diego Rosas Villalva, Lize Bynens, Jochen Vanderspikken, Christina Kousseff, Silène Gobeil, Olivier Bardagot, Nesibe Akmanşen‐Kalayci, Sarah H. Tolbert, Iain McCulloch, Wouter Maes, Demetra Tsokkou, Natalie Banerji   +14 more
wiley   +1 more source

On H-antimagic decomposition of toroidal grids and triangulations

AKCE International Journal of Graphs and Combinatorics, 2020
Let be a finite simple graph with p vertices and q edges. A decomposition of a graph G into isomorphic copies of a graph H is called (a, d)-H-antimagic if there is a bijection such that for all subgraphs isomorphic to H in the decomposition of G, the sum
Hendy, A. N. Mudholifah, K. A. Sugeng, Martin Bača, Andrea Semaničová-Feňovčíková   +4 more
doaj   +1 more source

Dynamic graph learning framework based seasonal and trend decomposition approach for potato crop evapotranspiration prediction

Efficient estimation of crop water requirements (ETc) is important for sustainable agricultural water management, particularly under increasing climate variability.
Zaman, Qamar Uz, Randhawa, Gurjit S., Farooque, Aitazaz A., Cheema, Saad Javed, Sadiq, Rehan, Ali, Mumtaz, Diykh, Mohammed, Malekian, Raheleh, Galagedara, Lakshman W., Saleem, Shoaib Rashid   +9 more
core   +1 more source