Results 51 to 60 of about 6,957 (218)
A graph G is said to be nonsingular (resp., singular) if its adjacency matrix A(G) is nonsingular (resp., singular). The inverse of a nonsingular graph G is the unique weighted graph whose adjacency matrix is similar to the inverse of the adjacency matrix A(G) via a diagonal matrix of ±1s.
openaire +1 more source
ABSTRACT This study conducts a comprehensive bibliometric analysis of technological innovation in renewable energy for the transport and logistics sector from 1996 to 2024. Using the Web of Science database, we identify three main research phases and map key collaboration networks and technological trends.
Yui‐yip Lau +4 more
wiley +1 more source
The Upper Bound of the Edge Mostar Index with Respect to Bicyclic Graphs
Let G be a connected graph; the edge Mostar index Moe(G) of G is defined as Moe(G)=∑e=uv∈E(G)|mu(e)−mv(e)|, where mu(e) and mv(e) denote the number of edges in G that are closer to vertex u than to vertex v and the number of edges that are closer to ...
Hui Wang, Mengmeng Liu
doaj +1 more source
ABSTRACT This paper presents the development and validation of a scalable platooning system based on the predecessor‐following (PF) topology, designed for low‐cost follower platforms. It integrates key technologies such as localization, path planning, profile generation, and low‐level control to create a practical solution.
Dongwoo Seo, Jinhee Lee, Jaeyoung Kang
wiley +1 more source
Diethyl 3-amino-6-methyl-4-[(E)-2-phenylethenyl]thieno[2,3-b]pyridine-2,5-dicarboxylate
In the title molecule, C22H22N2O4S, the bicyclic core is slightly folded [1.9 (1)°], while pairwise intermolecular N—H...O hydrogen bonding forms dimers across centers of symmetry.
Joel T. Mague +4 more
doaj +1 more source
On Minimum Generalized Degree Distance Index of Cyclic Graphs
Topological index (TI) is a mapping that associates a real number to the under study (molecular) graph which predicts its various physical and chemical properties.
Nadia Khan +3 more
doaj +1 more source
The signature of line graphs and power trees
Let $G$ be a graph and let $A(G)$ be the adjacency matrix of $G$. The signature $s(G)$ of $G$ is the difference between the positive inertia index and the negative inertia index of $A(G)$. Ma et al. [Positive and negative inertia index of a graph, Linear
Fan, Yi-Zheng, Wang, Long
core +1 more source
The limitations of conventional techniques hinder the identification of natural compounds with anticancer potential in terms of speed, throughput, sensitivity, and capability of continuous monitoring of relevant biological effects. Novel label‐free optical biosensors represent new opportunities in the discovery of drug candidates, eliminating these ...
Beatrix Péter +10 more
wiley +1 more source
Mallard response to experimental human disturbance on sanctuary areas is mediated by hunting
Wildlife managers often provide spatial sanctuaries for wildlife to escape both lethal (e.g. hunting) and non‐lethal (e.g. non‐consumptive recreation) human disturbance. However, as societal interest in outdoor recreation continues to climb, many areas face added pressure to allow recreation, yet studies increasingly demonstrate negative effects of ...
Abigail G. Blake‐Bradshaw +6 more
wiley +1 more source
The Minimal Total Irregularity of Graphs [PDF]
In \cite{2012a}, Abdo and Dimitov defined the total irregularity of a graph $G=(V,E)$ as \hskip3.3cm $\rm irr_{t}$$(G) = \frac{1}{2}\sum_{u,v\in V}|d_{G}(u)-d_{G}(v)|, $ \noindent where $d_{G}(u)$ denotes the vertex degree of a vertex $u\in V$.
Yang, Jieshan, You, Lihua, Zhu, Yingxue
core

