Results 81 to 90 of about 41,896 (267)
Total vertex irregularity strength of trees with maximum degree five
In 2010, Nurdin, Baskoro, Salman and Gaos conjectured that the total vertex irregularity strength of any tree T is determined only by the number of vertices of degrees 1, 2 and 3 in T. This paper will confirm this conjecture by considering all trees with
S. Susilawati +2 more
doaj +1 more source
Susceptibility of random graphs with given vertex degrees [PDF]
We study the susceptibility, i.e., the mean cluster size, in random graphs with given vertex degrees. We show, under weak assumptions, that the susceptibility converges to the expected cluster size in the corresponding branching process. In the supercritical case, a corresponding result holds for the modified susceptibility ignoring the giant component
openaire +2 more sources
Lead halide perovskite nanocrystals are promising scintillators but suffer from reabsorption losses and limited compatibility with high‐Z additives. Hybridization of CsPbBr3 nanocrystals with PbBr2‐passivated HfO2 nanoparticle sensitizers, achieved during or after synthesis, produces stable composites with maintained optical quality, improved ...
Francesco Bruni +17 more
wiley +1 more source
Selection Strategies for Flexible Pressure Sensor Electrode Materials Toward Ultrafast Response
This study reveals, for the first time, how the electrode–organic interface governs the temporal performance of flexible pressure sensors. By pairing high‐conductivity CVD PEDOT with commonly used metal electrodes, the authors demonstrate that interfacial energy alignment dictates microsecond‐scale response, providing a straightforward design strategy ...
Jinwook Baek +11 more
wiley +1 more source
Vertex-degree-based topological indices of uniform directed hypergraphs
Modelling a chemical network is crucial for understanding the complex interactions and dynamics within a chemical system, allowing for precise predictions of reaction behaviour under various conditions.
Shashwath S. Shetty, K. Arathi Bhat
doaj +1 more source
On Unigraphic Polyhedra with One Vertex of Degree $${p-2}$$
A sequence $σ$ of $p$ non-negative integers is unigraphic if it is the degree sequence of exactly one graph, up to isomorphism. A polyhedral graph is a $3$-connected, planar graph. We investigate which sequences are unigraphic with respect to the class of polyhedral graphs, meaning that they admit exactly one realisation as a polyhedron.
Delitroz J., Maffucci R. W.
openaire +3 more sources
On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion
16 pages, 4 figures, submitted to Elsevier's Journal of Discrete ...
Sounaka Mishra +2 more
openaire +2 more sources
Viscoelasticity‐driven instabilities are harnessed to create tunable, periodic textures in 3D‐printed liquid crystalline polymers. This study illustrates how processing parameters control these spontaneous meso‐scale patterns. These unique structural architectures unlock new possibilities for functional devices, ranging from photonic components to ...
Miaomiao Zou +17 more
wiley +1 more source
Functions on adjacent vertex degrees of trees with given degree sequence
Abstract In this note we consider a discrete symmetric function f(x, y) where $$f(x,a) + f(y,b) \geqslant f(y,a) + f(x,b) for any x \geqslant y and a \geqslant b,$$ associated with the degrees of adjacent vertices in a tree. The extremal trees with respect to the corresponding graph invariant, defined as $$\sum\limits_{uv \in E(T)} {f(
openaire +4 more sources
Introducing Pure Calcium Orthophosphate Gels and Aerogels
The synthesis of calcium phosphate‐based gels and aerogels is reported, which exhibit highly porous structures built up of networks of nanoparticles. In case of amorphous aerogels, this leads to yet unmatched specific BET surface areas, making these materials especially interesting for biomedical applications.
Oliver Jeske +4 more
wiley +1 more source

