Results 61 to 70 of about 34,901 (303)

Integrated Field‐Free SOT Domain‐Wall Synapses and MTJ Stochastic Neurons for Hardware Boltzmann Machines

Advanced Functional Materials, EarlyView.
Field‐free spin‐orbit torque domain‐wall synapses integrated with stochastic MTJ neurons enable compact hardware Boltzmann machines. Leveraging intrinsic stochasticity and multi‐level conductance, the system achieves efficient probabilistic learning with high accuracy, demonstrating a scalable spintronic platform for energy‐efficient edge AI.
Aijaz H. Lone, Meng Tang, Camelia Florica, Bin He, Jingkai Xu, Selma Amara, Georgian Melinte, Xixiang Zhang, Gianluca Setti   +8 more
wiley   +1 more source

Toughness and Triangle-Free Graphs

Journal of Combinatorial Theory, Series B, 1995
We prove that there exist triangle-free graphs with arbitrarily large toughness, thereby settling a longstanding open question. We also explore the problem of whether there exists a \(t\)-tough, \(n/(t + 1)\)-regular, triangle-free graph on \(n\) vertices for various values of \(t\), and provide a relatively complete answer for small values of \(t\).
Bauer, D., van den Heuvel, J., Schmeichel, E.   +2 more
openaire   +2 more sources

A derived graph: triangle graph of a graph

, 2021
A dissertation submitted in fulfilment of the requirements for the degree of Master of Science to the Faculty of Science, School of Mathematics, University of the Witwatersrand, Johannesburg, 2021In this dissertation we study a derived graph called the ...
Sithole, Elias
core  

Coaxially Electrospun Myocardial dECM‐ Based Nanofibrous Scaffolds Demonstrate Enhanced Cardiomyocyte Biocompatibility

Advanced Healthcare Materials, EarlyView.
Our coaxial electrospinning system is capable of incorporating decellularized myocardial extracellular matrix in a core‐sheath configuration, creating nanofibrous scaffolds. These scaffolds, in turn, support the maintenance of functional cardiomyocytes adhered to the surface of these bioactive scaffolds.
Dhanusha N. Rajapakse, Mahtab Khodadadi, Kiran M. Ali, Suh Hee Cook, Bryson T. Proctor, Tanya Upadhyay, Daxian Zha, Fatema Tuj Jahura, Marziyeh Boosaliki, Jessica M. Gluck   +9 more
wiley   +1 more source

Spin‐Split Edge States in Metal‐Supported Graphene Nanoislands Obtained by CVD

Advanced Materials, EarlyView.
Combining STM measurements and ab‐initio calculations, we show that zig‐zag edges in graphene nanoislands grown on Ni(111) by CVD retrieve their spin‐polarized edge states after intercalation of a few monolayers of Au. ABSTRACT Spin‐split states localized on zigzag edges have been predicted for different free‐standing graphene nanostructures.
Michele Gastaldo, Masoud Mansouri, Carlos Garcia‐Fernandez, Daniel Sánchez‐Portal, Aran Garcia‐Lekue, Gustavo Ceballos, Aitor Mugarza   +6 more
wiley   +1 more source

Mechanically Programmable DNA Hydrogel Microparticles for 3D Cellular Systems

Advanced Materials, EarlyView.
DNA hydrogel microparticles are designed to exhibit controllable viscoelasticity and stiffness across three orders of magnitude from 30Pa$30 \,\mathrm{Pa}$ to 6.5kPa$6.5 \,\mathrm{kPa}$. They are uptaken into fibroblast spheroids where they are actively remodeled by cellular forces depending on their mechanical properties.
Tobias Walther, Eleni Dalaka, Gotthold Fläschner, Manuel Gómez‐González, Ilia Platzman, Sadaf Pashapour, Michelle Emmert, Pere Roca‐Cusachs, Xavier Trepat, Kerstin Göpfrich   +9 more
wiley   +1 more source

A characterization of chordal graph without sun and co-rising sun as convex geometry

Theory and Applications of Graphs
In this paper we introduce the notion of $t_3$ \textit{convexity}, a natural restriction of triangle convexity. A \textit{triangle path} is a path allowing just short chords. A triangle path $P$ between two non-adjacent vertices in a graph $G$ is called $
Silvia B. Tondato
doaj   +1 more source

The spectrum problem for digraphs of order 4 and size 5 [PDF]

Opuscula Mathematica, 2018
The paw graph consists of a triangle with a pendant edge attached to one of the three vertices. We obtain a multigraph by adding exactly one repeated edge to the paw. Now, let \(D\) be a directed graph obtained by orientating the edges of that multigraph.
Ryan C. Bunge, Steven DeShong, Saad I. El-Zanati, Alexander Fischer, Dan P. Roberts, Lawrence Teng   +5 more
doaj   +1 more source

Extremal Graphs for Intersecting Triangles

Journal of Combinatorial Theory, Series B, 1995
A \(k\)-fan is a graph with \(2k+ 1\) vertices consisting of \(k\) 3-cycles having one vertex in common. The authors show that if \(n\geq 50k^2\) and the graph \(G_n\) has more than \([n^2/4]+ k^2- ck\) edges, where \(c\) equals 1 or 3/2 according as \(k\) is odd or even, then \(G_n\) contains a \(k\)-fan; furthermore, the bound for the number of edges
Paul Erdös, Zoltán Füredi, Ronald J. Gould, David S. Gunderson   +3 more
openaire   +2 more sources

Triangles in randomly perturbed graphs

Combinatorics, Probability and Computing, 2022
AbstractWe study the problem of finding pairwise vertex-disjoint triangles in the randomly perturbed graph model, which is the union of any $n$ -vertex graph $G$ satisfying a given minimum degree condition and the binomial random graph $G(n,p)$ .
Julia Böttcher, Olaf Parczyk, Amedeo Sgueglia, Jozef Skokan   +3 more
openaire   +2 more sources