Results 241 to 250 of about 55,873 (316)

Modeling of magnetic properties of A2BB′O6 compounds using ab initio and Monte Carlo methods

Journal of the American Ceramic Society, Volume 108, Issue 12, December 2025.
Ab initio and Monte Carlo simulations were employed to maximize the estimated Curie temperature of A2BB′O6 oxides. It was revealed that the element A ion radius should be as small as possible, while the magnetic moments of B and B′ elements should be as large as possible.
Martin Heczko, Martin Zeleny, Renaud Patte, Denis Ledue   +3 more
wiley   +1 more source

Hamiltonian cycles through a linear forest in bipartite graphs

Discussiones Mathematicae Graph Theory
Xia Li, Yashu Li, Weihua Yang
doaj   +1 more source

Dual‐Confinement Strategy Improves the Stability of High‐Entropy Alloys in Ultra‐Large Current Zinc‐Air Batteries

ENERGY &ENVIRONMENTAL MATERIALS, Volume 8, Issue 6, November 2025.
Illustration of the synthetic route and mechanism of HEAs with dual‐confinement strategy. This study developed a symbiotic dual‐confinement strategy integrating interstitial oxygen doping and carbon coating to enhance high‐entropy alloys for high‐current‐density zinc‐air batteries.
Xiaoxiao Zou, Songsong Zhi, Bohuai Pang, Xinyu Zhao, Hang Ma, Genfu Zhao, Hong Guo   +6 more
wiley   +1 more source

Visualizing dynamics of charges and strings in (2 + 1)D lattice gauge theories. [PDF]

Nature
Cochran TA, Jobst B, Rosenberg E, Lensky YD, Gyawali G, Eassa N, Will M, Szasz A, Abanin D, Acharya R, Aghababaie Beni L, Andersen TI, Ansmann M, Arute F, Arya K, Asfaw A, Atalaya J, Babbush R, Ballard B, Bardin JC, Bengtsson A, Bilmes A, Bourassa A, Bovaird J, Broughton M, Browne DA, Buchea B, Buckley BB, Burger T, Burkett B, Bushnell N, Cabrera A, Campero J, Chang HS, Chen Z, Chiaro B, Claes J, Cleland AY, Cogan J, Collins R, Conner P, Courtney W, Crook AL, Curtin B, Das S, Demura S, De Lorenzo L, Di Paolo A, Donohoe P, Drozdov I, Dunsworth A, Eickbusch A, Elbag AM, Elzouka M, Erickson C, Ferreira VS, Burgos LF, Forati E, Fowler AG, Foxen B, Ganjam S, Gasca R, Genois É, Giang W, Gilboa D, Gosula R, Grajales Dau A, Graumann D, Greene A, Gross JA, Habegger S, Hansen M, Harrigan MP, Harrington SD, Heu P, Higgott O, Hilton J, Huang HY, Huff A, Huggins W, Jeffrey E, Jiang Z, Jones C, Joshi C, Juhas P, Kafri D, Kang H, Karamlou AH, Kechedzhi K, Khaire T, Khattar T, Khezri M, Kim S, Klimov P, Kobrin B, Korotkov A, Kostritsa F, Kreikebaum J, Kurilovich V, Landhuis D, Lange-Dei T, Langley B, Lau KM, Ledford J, Lee K, Lester B, Le Guevel L, Li W, Lill AT, Livingston W, Locharla A, Lundahl D, Lunt A, Madhuk S, Maloney A, Mandrà S, Martin L, Martin O, Maxfield C, McClean J, McEwen M, Meeks S, Megrant A, Miao K, Molavi R, Molina S, Montazeri S, Movassagh R, Neill C, Newman M, Nguyen A, Nguyen M, Ni CH, Ottosson K, Pizzuto A, Potter R, Pritchard O, Quintana C, Ramachandran G, Reagor M, Rhodes D, Roberts G, Sankaragomathi K, Satzinger K, Schurkus H, Shearn M, Shorter A, Shutty N, Shvarts V, Sivak V, Small S, Smith WC, Springer S, Sterling G, Suchard J, Sztein A, Thor D, Torunbalci M, Vaishnav A, Vargas J, Vdovichev S, Vidal G, Vollgraff Heidweiller C, Waltman S, Wang SX, Ware B, White T, Wong K, Woo BWK, Xing C, Yao ZJ, Yeh P, Ying B, Yoo J, Yosri N, Young G, Zalcman A, Zhang Y, Zhu N, Zobrist N, Boixo S, Kelly J, Lucero E, Chen Y, Smelyanskiy V, Neven H, Gammon-Smith A, Pollmann F, Knap M, Roushan P.   +189 more
europepmc   +1 more source

Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges

, 2013
Fan Wang, Heping Zhang
openalex   +2 more sources

Spanning Plane Subgraphs of 1‐Plane Graphs

Journal of Graph Theory, Volume 110, Issue 3, Page 290-297, November 2025.
ABSTRACT A graph drawn on the plane is called 1‐plane if each edge is crossed at most once by another edge. In this paper, we show that every 4‐edge‐connected 1‐plane graph has a connected spanning plane subgraph. We also show that there exist infinitely many 4‐connected 1‐plane graphs that have no 2‐connected spanning plane subgraphs.
Kenta Noguchi, Katsuhiro Ota, Yusuke Suzuki   +2 more
wiley   +1 more source

The optimal route search in Bengaluru city transport using Hamilton circuit algorithm. [PDF]

Heliyon
S P, A P.
europepmc   +1 more source

Hamiltonian cycles in Cayley graphs of imprimitive complex reflection groups

, 2013
Cathy Kriloff, Terry Lay
openalex   +2 more sources

Hamiltonian cycles in the cartesian product of a tree and a cycle

Discrete Mathematics, 1982
Tomaž Pisanski, Vladimir Batagelj
openaire   +3 more sources

Recognizing Trees From Incomplete Decks

Journal of Graph Theory, Volume 110, Issue 3, Page 322-336, November 2025.
ABSTRACT Given a graph G, the unlabeled subgraphs G − v are called the cards of G. The deck of G is the multiset { G − v : v ∈ V ( G ) }. Wendy Myrvold showed that a disconnected graph and a connected graph both on n vertices have at most ⌊ n 2 ⌋ + 1 cards in common and found (infinite) families of trees and disconnected forests for which this upper ...
Gabriëlle Zwaneveld
wiley   +1 more source