Results 81 to 90 of about 60,523 (284)
Advanced Materials, EarlyView.A new family of Na‐Zr‐S‐Cl sulfide‐chloride Na SSEs with tailored anion compositions is explored. A high ionic conductivity is realized for both Cl‐rich and Cl‐deficient structures, attributed to the unique chloride bridging structure and low Na‐ion migration barrier.
Zhi Liang Dong +15 more
wiley +1 more source
Two Sufficient Conditions for Hamilton and Dominating Cycles
International Journal of Mathematics and Mathematical Sciences, 2012 We prove that if is a 2-connect graph of size (the number of edges) and minimum degree with , where when and when , then each longest cycle in is a dominating cycle.
Zh. G. Nikoghosyan
doaj +1 more source
Hamiltonicity of 3tEC Graphs with α=κ+1
Journal of Mathematics, 2021 A set S of vertices in a graph G is a total dominating set of G if every vertex of G is adjacent to some vertex in S. The minimum cardinality of a total dominating set of G is the total domination number γtG of G.
Huanying He, Xinhui An, Zongjun Zhao
doaj +1 more source
Advanced Materials, EarlyView.The electronic configuration of Mn single‐atom sites is regulated from low‐spin to high‐spin states by embedding well‐defined molybdenum phosphide nanocrystals nearby (MoP@MnSAC‐NC). The electronic phosphide‐support interaction between MoP and Mn single atoms drives the electronic structure transition in Mn sites from low‐spin to high‐spin states, and ...
Zuyang Luo +9 more
wiley +1 more source
Hamilton cycles and eigenvalues of graphs
Linear Algebra and its Applications, 1995 AbstractWe prove some results concerning necessary conditions for a graph to be Hamiltonian in terms of eigenvalues of certain matrices associated with the graph. As an example, we show how the results give an easy algebraic proof of the nonexistence of a Hamilton cycle in two graphs, one of them being the Petersen graph.
openaire +2 more sources
Advanced Materials Interfaces, EarlyView.The spraying of nanomaterials on the polymer surface, combined with laser treatment, embeds the nanomaterials in treated regions. The adhesive delamination process removes the non‐embedded nanomaterials and generates different patterns on the surface. This method is versatile and can be used to fabricate various types of sensors.
Mehraneh Tavakkoli Gilavan +5 more
wiley +1 more source
The number of cycles in a hamilton graph
Discrete Mathematics, 1994 AbstractThe set of Hamilton graphs (having no loops) with n(⩾2) vertices and n+k edges is denoted by Γk and the number of distinct cycles of a graph G is denoted by ƒG). Let m(k)= min {ƒ(G); G∈Γk} and M(k)=max {z.hfl;(G); Gisin;Γk}. Yap and Teo (1984) raised the following questions:(1) Is it true that m(k)=(k+1)(k+2)/2?(2) Is it true that M(k)=2k+k?(3)
openaire +2 more sources
A Microfluidic Multiplex Sorter for Strain Development
Advanced Materials Technologies, Volume 10, Issue 6, March 18, 2025.A new multiplex method for high‐throughput screening of yeast strains based on glucoamylase production is presented. Droplets containing single mutant yeast cells are incubated for enzyme production. A sorting platform divides mutants by their high‐ and mid‐activity levels.
Chiara Leal‐Alves +6 more
wiley +1 more source
Hamilton cycles in random lifts of graphs
European Journal of Combinatorics, 2015 For a graph $G$ the random $n$-lift of $G$ is obtained by replacing each of its vertices by a set of $n$ vertices, and joining a pair of sets by a random matching whenever the corresponding vertices of $G$ are adjacent. We show that asymptotically almost surely the random lift of a graph $G$ is hamiltonian, provided $G$ has the minimum degree at least $
Łukasz Witkowski +2 more
openaire +3 more sources