Results 91 to 100 of about 39,392 (275)
On The Graphs and Their Complements with Prescribed Circumference
Jurnal Ilmu Dasar, 2012 Let Gt(n) be the class of connected graphs on n vertices having the longest cycle of length t and let G ∈ Gt(n). Woodall (1976) determined the maximum number of edges of G.
TA Kusmayadi, L Caccetta
doaj
Information Inequalities via Submodularity and a Problem in Extremal Graph Theory. [PDF]
Entropy (Basel), 2022 Sason I.
europepmc +1 more source
Advanced Functional Materials, EarlyView.A Cu‐based crystal‐glass composite with high‐density twins is identified by a fast screening technique using combinatorial sputtering together with XRD and nanoindentation mapping. This bamboo‐like structure demonstrates homogenous plastic flow and retains high strength during in situ high temperature tests, up to 1 GPa at 550°C, owing to those ...
Chunhua Tian +10 more
wiley +1 more source
Graph polynomials for a class of DI-pathological graphs
AKCE International Journal of Graphs and Combinatorics, 2020 Let be a simple graph. A dominating set is a set such that the closed neighborhood of is the entire vertex set. An independence set of a graph is a subset of vertices that are pairwise non-adjacent.
James M. Hammer, Joshua Harrington
doaj +1 more source
Parallel 3D Bioprinting on SLIPS‐Microarrays
Advanced Functional Materials, EarlyView.This work introduces the first truly parallel 3D bioprinting method, enabling both the simultaneous fabrication of hundreds of cell laden hydrogel 3D structures and their HTS in individual liquid compartments. By integrating Digital Light Processing (DLP) stereolithography with functional micropatterns, the platform decouples printing time from array ...
Julius von Padberg +3 more
wiley +1 more source
On the harmonic index of bicyclic graphs
Communications in Combinatorics and Optimization, 2018 The harmonic index of a graph $G$, denoted by $H(G)$, is defined as the sum of weights $2/[d(u)+d(v)]$ over all edges $uv$ of $G$, where $d(u)$ denotes the degree of a vertex $u$. Hu and Zhou [Y. Hu and X. Zhou, WSEAS Trans. Math.
R. Rasi
doaj +1 more source
Commuting graphs and extremal centralizers
Ars Mathematica Contemporanea, 2013 We determine the conditions for matrix centralizers which can guarantee the connectedness of the commuting graph for the full matrix algebra M n ( F ) over an arbitrary field F . It is known that if F is an algebraically closed field and n ≥ 3 , then the diameter of the commuting graph of M n ( F ) is always equal to four.
Dolinar, Gregor +3 more
openaire +4 more sources
Photon Avalanching Nanoparticles: The Next Generation of Upconverting Nanomaterials?
Advanced Functional Materials, EarlyView.This Perspective outlines the mechanistic foundations that enable photon‐avalanche (PA) behavior in lanthanide nanomaterials and contrasts them with emerging application spaces and forward‐looking design strategies. By bridging threshold engineering, energy‐transfer dynamics, and materials engineering, we provide a coherent roadmap for advancing the ...
Kimoon Lee +7 more
wiley +1 more source
Light‐Actuated Fiber‐Climbing Inchworm Robot Toward Endoluminal Navigation
Advanced Functional Materials, EarlyView.A kirigami‐inspired soft inchworm robot harnesses optical energy from a customized side‐emitting optical fiber, guaranteeing its propulsion along the fiber body. The wavelength‐selective responsiveness of dye‐functionalized liquid crystal elastomers and the application of temporal illumination patterns enable sequential control of robot components. The
Antonio Lobosco +6 more
wiley +1 more source
Advanced Functional Materials, EarlyView.ABSTRACT Traditional wearable exoskeletons rely on rigid structures, which limit comfort, flexibility, and everyday usability. This work introduces the fundamental technologies to create the first soft, lightweight, intelligent textile‐based exoskeletons (Texoskeletons) built using 1D sensors and actuators.
Amy Lukomiak +19 more
wiley +1 more source