Results 91 to 100 of about 167 (150)

On the multiplicative sum Zagreb index of molecular graphs

open access: yesOpen Mathematics
Multiplicative sum Zagreb index is a modified version of the famous Zagreb indices. For a graph GG, the multiplicative sum Zagreb index is defined as Π1*(G)=∏uv∈E(G)(dG(u)+dG(v)){\Pi }_{1}^{* }\left(G)={\prod }_{uv\in E\left(G)}\left({d}_{G}\left(u)+{d}_{
Sun Xiaoling, Du Jianwei, Mei Yinzhen
doaj   +1 more source

On Extended Adjacency Index with Respect to Acyclic, Unicyclic and Bicyclic Graphs

open access: yesMathematics, 2019
For a (molecular) graph G, the extended adjacency index E A ( G ) is defined as Equation (1). In this paper we introduce some graph transformations which increase or decrease the extended adjacency ( E A ) index.
Bin Yang   +4 more
doaj   +1 more source

Moment‐to‐Moment Dynamics of Foreign Language Enjoyment: An Idiodynamic Study of Conversational Topics Among Young Language Learners

open access: yesEuropean Journal of Education, Volume 61, Issue 3, September 2026.
ABSTRACT Foreign Language Enjoyment has received increasing attention in second language acquisition due to its role in fostering engagement and communication. Although previous research has often treated enjoyment as a relatively stable trait, perspectives informed by Complex Dynamic Systems Theory (CDST) suggest that emotions are dynamic, non‐ergodic,
Mojdeh Shahnama   +4 more
wiley   +1 more source

On The Determinant of q-Distance Matrix of a Graph

open access: yesDiscussiones Mathematicae Graph Theory, 2014
In this note, we show how the determinant of the q-distance matrix Dq(T) of a weighted directed graph G can be expressed in terms of the corresponding determinants for the blocks of G, and thus generalize the results obtained by Graham et al.
Li Hong-Hai, Su Li, Zhang Jing
doaj   +1 more source

Computing the Determinant of the Distance Matrix of a Bicyclic Graph

open access: yesElectronic Notes in Theoretical Computer Science, 2019
Abstract Let G be a connected graph with vertex set V = {v1, ..., vn}. The distance d(vi, vj) between two vertices vi and vj is the number of edges of a shortest path linking them. The distance matrix of G is the n × n matrix such that its (i, j)-entry is equal to d(vi, vj).
Ezequiel Dratman   +4 more
openaire   +2 more sources

An Energy Autonomous Microneedle Array‐Based Sensing System for Continuous Biomarker Monitoring

open access: yesAdvanced Science, Volume 13, Issue 46, 17 August 2026.
This work presents an innovative self‐powered wearable biosensor system for real‐time monitoring of multiple biomarkers in interstitial fluid. The device integrates stainless steel‐based minimally invasive microneedles with ion‐selective membranes, enabling simultaneous Na+, K+, Ca2+, pH, and glucose detection.
Arnab Pal   +9 more
wiley   +1 more source

On Sombor index and graph energy of some chemically important graphs

open access: yesExamples and Counterexamples
Sombor index of a graph G=(V(G),E(G)) is provided by the expression ∑uv∈E(G)du2+dv2, where dx is the degree of the vertex x∈V(G). The energy of a graph is the quantity given by the total of the absolute values of its adjacency matrix’s eigenvalues.
Md Selim Reja, Sk. Md. Abu Nayeem
doaj   +1 more source

Flanking‐Group Engineering Unlocks Emerging Functionalities in Diketopyrrolopyrrole Semiconductors

open access: yesAdvanced Science, Volume 13, Issue 46, 17 August 2026.
This review presents a comprehensive and unified perspective of flanking‐group engineering in Diketopyrrolopyrrole (DPP) based organic semiconductors that connects molecular‐level design with cross‐device functionalities. By integrating insights from molecular design, solid‐state packing, and device physics, this review seeks to establish general ...
Xiaoyun Wu   +5 more
wiley   +1 more source

On Distance Laplacian Energy of Unicyclic and Bicyclic Graphs

open access: yesAxioms
For a connected graph G, let DL(G) be its distance Laplacian matrix and λ1(G)≥λ2(G)≥…≥λn−1(G)>λn(G)=0 be its DL eigenvalues. The DL energy of G is defined as DLEG=∑i=1nλi(G)−2WGn, where W(G) is the Wiener index of G.
Dan Li, Shiqi Zhou
doaj   +1 more source

Discovery of VEGFR‐2 Inhibitors From Leonurus japonicus via Integrated Genetic Authentication, Molecular Networking, and In Silico Analysis

open access: yesArchiv der Pharmazie, Volume 359, Issue 8, August 2026.
Genetic authentication of Leonurus japonicus was confirmed using ITS sequencing. UHPLC‐MS/MS‐GNPS analysis and isolation led to a new labdane diterpenoid (1) and known compounds (2–6), with anti‐angiogenic activity validated by EPC assays and VEGFR‐2 docking studies.
Thiyagarajan Raviraj   +16 more
wiley   +1 more source

Home - About - Disclaimer - Privacy