Results 61 to 70 of about 577,160 (277)
Commuting decomposition of Kn1,n2,...,nk through realization of the product A(G)A(GPk )
In this paper, we introduce the notion of perfect matching property for a k-partition of vertex set of given graph. We consider nontrivial graphs G and GPk , the k-complement of graph G with respect to a kpartition of V(G), to prove that A(G)A(GPk ) is ...
Bhat K. Arathi, Sudhakara G.
doaj +1 more source
Removing Oxide Layers and Retaining Oxide‐Free Steel Surfaces by Polishing in Oxygen‐Free Atmosphere
In this study, the efficacy of wet mechanical polishing under an oxygen‐free atmosphere for deoxidation and the retention of an oxide‐free steel surface are elucidated using X‐ray photoelectron spectroscopy. The methodology proved successful; however, the results were highly dependent on the preparation of the solvents used to clean the samples after ...
Friedrich Bürger +2 more
wiley +1 more source
A sharp lower bound on the signless Laplacian index of graphs with (κ,τ)-regular sets
A new lower bound on the largest eigenvalue of the signless Laplacian spectra for graphs with at least one (κ,τ)regular set is introduced and applied to the recognition of non-Hamiltonian graphs or graphs without a perfect matching.
Andeelić Milica +2 more
doaj +1 more source
The maximum forcing number of polyomino [PDF]
The forcing number of a perfect matching $M$ of a graph $G$ is the cardinality of the smallest subset of $M$ that is contained in no other perfect matchings of $G$.
Lin, Yuqing, Xu, Liqiong, Zhang, Fuji
core
The wettability of aluminum droplets (Al) on different copper substrates (Cu), where liquid Al spreads on solid Cu surfaces to form a liquid–solid interface, is studied numerically and experimentally. The experimental and numerical results show good agreement in the fast‐spreading regime.
Shan Lyu +8 more
wiley +1 more source
Matching Extendabilities of G = Cm ∨ Pn
A graph is considered to be induced-matching extendable (bipartite matching extendable) if every induced matching (bipartite matching) of G is included in a perfect matching of G. The induced-matching extendability and bipartite-matching extendability of
Zhi-hao Hui +3 more
doaj +1 more source
Computing Unique Maximum Matchings in O(m) time for Konig-Egervary Graphs and Unicyclic Graphs [PDF]
Let alpha(G) denote the maximum size of an independent set of vertices and mu(G) be the cardinality of a maximum matching in a graph G. A matching saturating all the vertices is perfect.
Levit, Vadim E., Mandrescu, Eugen
core
This work explores Li‐substituted P2 layered oxides for Na‐ion batteries by crystallographic and electrochemical studies. The effect of lithium on superstructure orderings, on phase transitions during synthesis and electrochemical cycling and on the interplay of O‐ versus TM‐redox is revealed via various advanced techniques, including semi‐simultaneous
Mingfeng Xu +5 more
wiley +1 more source
Substrate Stress Relaxation Regulates Cell‐Mediated Assembly of Extracellular Matrix
Silicone‐based viscoelastic substrates with tunable stress relaxation reveal how matrix mechanics regulates cellular mechanosensing and cell‐mediated matrix remodelling in the stiff regime. High stress relaxation promotes assembly of fibronectin fibril‐like structures, increased nuclear localization of YAP and formation of β1 integrin‐enriched ...
Jonah L. Voigt +2 more
wiley +1 more source
Electroactive Metal–Organic Frameworks for Electrocatalysis
Electrocatalysis is crucial in sustainable energy conversion as it enables efficient chemical transformations. The review discusses how metal–organic frameworks can revolutionize this field by offering tailorable structures and active site tunability, enabling efficient and selective electrocatalytic processes.
Irena Senkovska +7 more
wiley +1 more source

