Results 51 to 60 of about 4,390 (196)
Corporate Social Responsibility and Environmental Management, EarlyView.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 minimal degree Kirchhoff index of bicyclic graphs
AIMS MathematicsThe degree Kirchhoff index of graph $ G $ is defined as $ Kf^{*}(G) = \sum\limits_{{u, v}\subseteq V(G)}d(u)d(v)r_{G}(u, v) $, where $ d(u) $ is the degree of vertex $ u $ and $ r_{G}(u, v) $ is the resistance distance between the vertices $ u $ and $ v $
Yinzhen Mei, Chengxiao Guo
doaj +1 more source
VIEW, EarlyView.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 Biology, EarlyView.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
Bicyclic graphs with exactly two main signless Laplacian eigenvalues [PDF]
, 2013 A signless Laplacian eigenvalue of a graph $G$ is called a main signless Laplacian eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero.
Deng, Hanyuan, Huang, He
core
Non-regular graphs with minimal total irregularity
, 2014 The {\it total irregularity} of a simple undirected graph $G$ is defined as ${\rm irr}_t(G) =$ $\frac{1}{2}\sum_{u,v \in V(G)}$ $\left| d_G(u)-d_G(v) \right|$, where $d_G(u)$ denotes the degree of a vertex $u \in V(G)$.
Abdo, Hosam, Dimitrov, Darko
core +1 more source
On the nullity of bicyclic graphs
Linear Algebra and its Applications, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hu, Shengbiao +2 more
openaire +2 more sources
CAAI Transactions on Intelligence Technology, EarlyView.Abstract In intelligent transportation systems, object detection for a surveillance video is one of the important functions. The performance of existing surveillance video object detection algorithms is affected by the conflict between the features of the objects, which leads to a decline in precision.
Yang He +5 more
wiley +1 more source
The Connected Detour Numbers of Special Classes of Connected Graphs
Journal of Mathematics, 2019 Simple finite connected graphs G=V,E of p≥2 vertices are considered in this paper. A connected detour set of G is defined as a subset S⊆V such that the induced subgraph GS is connected and every vertex of G lies on a u−v detour for some u,v∈S.
Ahmed M. Ali, Ali A. Ali
doaj +1 more source
On a conjecture about tricyclic graphs with maximal energy [PDF]
, 2014 For a given simple graph $G$, the energy of $G$, denoted by $\mathcal {E}(G)$, is defined as the sum of the absolute values of all eigenvalues of its adjacency matrix, which was defined by I. Gutman. The problem on determining the maximal energy tends to
Li, Jing +3 more
core +1 more source