Results 121 to 130 of about 113,956 (308)
This study explores the effects of pixel size and spacing when fabricating electroluminescent (EL) multipixel displays. COMSOL simulations identify the impact of pixel dimensions and spacing on electric field distribution and lighting efficiency. Flexible, high‐resolution EL pixel arrays are reverse offset printed, achieving a 96% reduction in pixel ...
Huanghao Dai+3 more
wiley +1 more source
Distribution of sandflies (Diptera: Phlebotominae) in forest remnants and adjacent matrix habitats in Brazilian Amazonia [PDF]
A. S. De Luca+2 more
openalex +1 more source
Graded refractive index (GRI) structures are prepared from the layer‐by‐layer spray coating of the mesoporous SiO2 nanoparticles, showing high solar transparency and thermal emissivity. Under outdoor conditions, after 50 days, the GRI‐coated photovoltaics show on average 6.65 ± 1.48 °C lower than that of the non‐coated references, maintaining 80.9 ± 8 ...
Heesuk Jung+14 more
wiley +1 more source
Semigraph is a generalization of graph. We introduce the concept of energy in a semigraph in two ways, one, the matrix energy , as summation of singular values of the adjacency matrix of a semigraph, and the other, polynomial energy , as energy of the ...
Gaidhani Y.S.+2 more
doaj +1 more source
Restricted expression of membrane type 1‐matrix metalloproteinase by myofibroblasts adjacent to human breast cancer cells [PDF]
Christèle Bisson+10 more
openalex +1 more source
The Maximum Order of Adjacency Matrices With a Given Rank [PDF]
AMS Subject Classification: 05B20, 05C50.Graph;Adjacency ...
Haemers, W.H., Peeters, M.J.P.
core +1 more source
In this study, the unique role of the unusual lone‐pair‐π conjugation mechanism in poly(1,4‐anthraquinone) (P14AQ) is explored as an organic electrode material. Unlike traditional π‐π interactions, P14AQ's conjugation involves lone pairs of oxygen atoms interacting with the π cloud of adjacent units, enabling stable charge transport even with minimal π‐
Xiaotong Zhang, Piotr de Silva
wiley +1 more source
On the second minimizing graph in the set of complements of trees
Let G be a graph of order n and A(G)=[ai,j]be its adjacency matrix such that ai,j=1 if viis adjacent to vjand ai,j=0 otherwise, where 1≤i,j≤n. In a certain family of graphs, a graph is called minimizing (or second minimizing) if the least eigenvalue of ...
M. Javaid
doaj
Degree based energy and spectral radius of a graph with self-loops
Let GX be a graph obtained from a simple graph G by attaching a self-loop at each vertex of [Formula: see text]. The general extended adjacency matrix for the graph GX is defined and the bounds for the degree based energy of the graph GX are obtained ...
Shashwath S. Shetty, Arathi Bhat K
doaj +1 more source
Spectra of Graphs Resulting from Various Graph Operations and Products: a Survey
Let G be a graph on n vertices and A(G), L(G), and |L|(G) be the adjacency matrix, Laplacian matrix and signless Laplacian matrix of G, respectively. The paper is essentially a survey of known results about the spectra of the adjacency, Laplacian and ...
Barik S., Kalita D., Pati S., Sahoo G.
doaj +1 more source