885 citations
- University of Pavol Jozef ŠafárikSK297 papers
- Slovak Academy of SciencesSK267 papers
- HUN-REN Wigner Research Centre for PhysicsHU263 papers
- Hiroshima UniversityJP261 papers
- The University of TokyoJP261 papers
- University of BirminghamGB261 papers
- University of OsloNO261 papers
- Central China Normal UniversityCN260 papers
- Comenius University BratislavaSK260 papers
- Czech Academy of Sciences, Nuclear Physics InstituteCZ260 papers
- FZU ‒ Institute of Physics of the Academy of Sciences of the Czech RepublicCZ260 papers
- Heidelberg UniversityDE260 papers
5 papers · 1 filter
Vigorous thermal excitations in a double-tetrahedral chain of localized Ising spins and mobile electrons mimic a temperature-driven first-order phase transition
Lucia Galisova, Jozef Strecka
A hybrid spin-electron system defined on one-dimensional double-tetrahedral chain, in which the localized Ising spin regularly alternates with two mobile electrons delocalized over…
Ground state, magnetization process and magnetocaloric effect of the exactly tractable spin-electron tetrahedral chain
Lucia Gálisová, Jozef Strečka
A hybrid spin-electron system on one-dimensional tetrahedral chain, in which the localized Ising spin regularly alternates with the mobile electron delocalized over three lattice s…
Algorithm and Simulation of Heat Conduction Process for Design of a Thin Multilayer Technical Device
Alexander Ayriyan, Jan Busa, Eugeny E. Donets +2
A model of a multilayer device with non-trivial geometrical structure and nonlinear dependencies of thermodynamic material properties at cryogenic temperatures is suggested. A cons…
Three classes of 1-planar graphs
Július Czap, Peter Šugerek
A graph is called 1-planar if it can be drawn in the plane so that each of its edges is crossed by at most one other edge. In this paper we decompose the set of all 1-planar graphs…
Joins of 1-planar graphs
Július Czap, Dávid Hudák, Tomáš Madaras
A graph is called 1-planar if there exists its drawing in the plane such that each edge is crossed at most once. In this paper, we study 1-planar graph joins. We prove that the joi…