Results 71 to 80 of about 4,479,442 (268)
ABSTRACT Industrial clusters are central to the circular economy transition, yet how they develop into eco‐clusters and the paradoxical tensions this transformation fuels remain underexplored. Drawing on 48 in‐depth interviews and secondary data from a Turkish textile‐recycling cluster, we develop an empirically grounded model of eco‐cluster transition
Tulin Dzhengiz +2 more
wiley +1 more source
Maize Kernel Composition and Morphology Influences Pericarp Retention During Nixtamalization
Abstract Background and Objectives Pericarp retention during nixtamalization directly influences masa quality, affecting texture, machinability, and nutritional content of staple foods such as tortillas and chips. Despite its industrial relevance, the underlying kernel traits that govern pericarp retention remain poorly characterized.
Michael J. Burns +4 more
wiley +1 more source
ESTRADA INDEX OF GENERAL WEIGHTED GRAPHS [PDF]
AbstractLet $G$ be a general weighted graph (with possible self-loops) on $n$ vertices and $\lambda _1,\lambda _2,\ldots ,\lambda _n$ be its eigenvalues. The Estrada index of $G$ is a graph invariant defined as $EE=\sum _{i=1}^ne^{\lambda _i}$. We present a generic expression for $EE$ based on weights of short closed walks in $G$.
openaire +2 more sources
ABSTRACT This phenomenological study explored the lived experiences of bilingual Spanish‐speaking counselors‐in‐training (BS‐CITs) enrolled in a Spanish internship course within a Bilingual Counseling Certificate program. Participants included nine master's‐level counseling students who completed individual, semi‐structured interviews.
Claudia G. Interiano‐Shiverdecker +2 more
wiley +1 more source
Resolvent Estrada index for circulant graphs(循环图的预解Estrada指标)
循环图是一类常用的网络拓扑图.作为一种复杂网络的中心度——图的预解Estrada指标被定义为,这里,λ1,λ2 ,…,λn是图G的邻接矩阵的特征值.利用Ramanujan和,借助于欧拉函数和莫比乌斯函数,讨论并得到了循环图的预解Estrada指标的下界以及整循环图的预解Estrada指标的几个计算公式.
ZHOUHouqing(周后卿)
doaj +1 more source
As a generalization of the Sierpiński-like graphs, the subdivided-line graph Г(G) of a simple connected graph G is defined to be the line graph of the barycentric subdivision of G.
Shang Yilun
doaj +1 more source
Dehulling combined with twin‐screw extrusion improves the nutritional and functional properties of steam treated navy beans. Protein digestibility increases while phytic acid is reduced by 43% and trypsin inhibitors are inactivated. Enhanced expansion, solubility, and sensory quality highlight the potential of dehulled bean flours for developing ...
Albarracín M, Garzon AG, Drago SR
wiley +1 more source
π‐Extended Salphen Scaffolds Enable CO2 Electroreduction and Singlet Oxygen Generation
New family of π‐extended salen ligands bearing phenylene bridge and tunable phenyl‐based substituents, and their corresponding boron difluoride complexes. Thanks to the extended π‐delocalization over the molecule, the ligands themselves show promising results in electrochemical CO2 reduction to CO, while the complexes act as efficient photosensitizers ...
Vincenzo Langellotti +10 more
wiley +1 more source
Bounds of distance Estrada index of graphs
Let $λ_1,λ_2,\cdots,λ_n$ be the eigenvalues of the distance matrix of a connected graph $G$. The distance Estrada index of $G$ is defined as $DEE(G)=\sum_{i=1}^ne^{λ_i}$. In this note, we present new lower and upper bounds for $DEE(G)$. In addition, a Nordhaus-Gaddum type inequality for $DEE(G)$ is given.
openaire +2 more sources
The Estrada index of unicyclic graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Du, Zhibin, Zhou, Bo
openaire +2 more sources

