Results 101 to 110 of about 64,086 (307)
Coloring of graph of ring with respect to idempotents [PDF]
Mathematica BohemicaLet $R$ be a ring with nonzero identity. A graph $G_{{\rm Id}}(R)$ of $R$ with respect to idempotents of $R$ has elements of $R$ as vertices and distinct vertices $x$, $y$ are adjacent if and only if $x + y$ is an idempotent of $R$.
Avinash Patil, Dipika Patil
doaj +1 more source
Inverse Design of Amorphous Materials With Targeted Properties
Advanced Materials, EarlyView.AMDEN is a diffusion model framework for the inverse design of amorphous materials with targeted properties. By incorporating Hamiltonian Monte Carlo refinement into the denoising process, the framework overcomes the challenge of generating thermally relaxed disordered structures.
Jonas A. Finkler +4 more
wiley +1 more source
Approximating Maximum Edge 2-Coloring by Normalizing Graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceIn a simple, undirected graph G, an edge 2-coloring is a coloring of the edges such that no vertex is incident to edges with more than 2 distinct colors.
Tobias Mömke +4 more
doaj +1 more source
Discrete Mathematics, 1995 Let \(G\) be a graph. A set \(X\) of vertices of \(G\) is said to be a dominating set of vertices of \(G\) if \(V(G)\) is contained in the closed neighbourhood of \(X\). The smallest cardinality of a dominating set of vertices in \(G\) is called the domination number of \(G\) and is denoted by \(\gamma(G)\). Let \(X\) be a set of vertices of \(G\).
openaire +1 more source
Decomposing Berge graphs and detecting balanced skew partitions [PDF]
We prove that the problem of deciding whether a graph has a balanced skew partition is NP-hard. We give an O(n9)-time algorithm for the same problem restricted to Berge graphs.
Nicolas Trotignon
core
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
哈林图的偶匹配可扩性(Bipartite matching-extendability of Halin graphs)
Zhejiang Daxue xuebao. Lixue ban, 2009 Let G be a connected graph containing a perfect matching. G is said to be bipartite matching extendable if every matching M of G whose induced subgraph is a bipartite matching extends to a perfect matching of G. The main result is as follows: Halin graph
HUIZhi-hao(惠志昊), ZHAOBiao(赵飚)
doaj +1 more source
Journal of Graph Theory, 2005 AbstractFor 1 ≤ d ≤ k, let Kk/d be the graph with vertices 0, 1, …, k − 1, in which i ∼j if d ≤ |i − j| ≤ k − d. The circular chromatic number χc(G) of a graph G is the minimum of those k/d for which G admits a homomorphism to Kk/d. The circular clique number ωc(G) of G is the maximum of those k/d for which Kk/d admits a homomorphism to G. A graph G is
openaire +1 more source
On the Existence of Markov Perfect Equilibria in Perfect Information Games [PDF]
We study the existence of pure strategy Markov perfect equilibria in two-person perfect information games. There is a state space X and each period player's possible actions are a subset of X.
Hannu Vartiainen, Hannu Salonen
core
Advanced Materials, EarlyView.We introduce a computational workflow that combines quantum chemical calculations and machine learning techniques to predict the catalytic performance of a wide range of catalysts in the nitrogen reduction reaction (NRR). The analysis of the trained models provides insights into the complex structure–activity relationship in experimental catalytic ...
Leonardo Di Ciano +5 more
wiley +1 more source