Results 61 to 70 of about 1,962 (215)
On the index of bicyclic graphs with perfect matchings
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
AnAn Chang, Feng Tian, Aimei Yu
openaire +2 more sources
This study develops and evaluates a solar PV‐fed electric bicycle system optimized for university campuses in Pakistan. The techno‐economic analysis demonstrates significant fuel savings, emission reductions, and sustainability benefits, promoting a cost‐effective, eco‐friendly, and renewable transportation alternative amid rising global fuel and ...
Muhammad Abdullah Khan +4 more
wiley +1 more source
Mili\v{c}evi\'{c} \textit{et al.}, in 2004, introduced topological indices known as Reformulated Zagreb indices, where they modified Zagreb indices using the edge-degree instead of vertex degree.
Abhay Rajpoot, Lavanya Selvaganesh
doaj +1 more source
On Sum--Connectivity Index of Bicyclic Graphs
We determine the minimum sum--connectivity index of bicyclic graphs with $n$ vertices and matching number $m$, where $2\le m\le \lfloor\frac{n}{2}\rfloor$, the minimum and the second minimum, as well as the maximum and the second maximum sum--connectivity indices of bicyclic graphs with $n\ge 5$ vertices. The extremal graphs are characterized.
Du, Zhibin, Zhou, Bo
openaire +3 more sources
On‐Time Meal Delivery Assisted by Drone Resupply
ABSTRACT Ensuring timely delivery is crucial with the increasing competition in online meal delivery services. This requires the industry to adopt new technologies and the corresponding operational models, including the use of drones. Concerning the desired features of meal delivery, such as safety and reliability, we propose an operational model that ...
Wenqian Liu, Lindong Liu, Xiangtong Qi
wiley +1 more source
Matrix models of bar graph data display for bicyclic excitation of the optoelectronic scale
In this work, being based on the theory of sets and matrix formulation of the information area for a bar graph display the author obtained a matrix description for electric signals necessary to form two variants of bicyclic excitation of the ...
Bushma, A.V.
core +2 more sources
Sharp Bounds of the Hyper-Zagreb Index on Acyclic, Unicylic, and Bicyclic Graphs
The hyper-Zagreb index is an important branch in the Zagreb indices family, which is defined as ∑uv∈E(G)(d(u)+d(v))2, where d(v) is the degree of the vertex v in a graph G=(V(G),E(G)). In this paper, the monotonicity of the hyper-Zagreb index under some
Wei Gao +5 more
doaj +1 more source
Allocation of Indivisible Items With a Common Preference Graph: Minimizing Total Dissatisfaction
ABSTRACT Allocating indivisible items among a set of agents is a frequently studied discrete optimization problem. In the setting considered in this work, the agents' preferences over the items are assumed to be identical. We consider a very recent measure for the overall quality of an allocation which does not rely on numerical valuations of the items.
Nina Chiarelli +6 more
wiley +1 more source
Unsaturated biobased polyesters from bicyclic α‐pinene‐based diols
We present the synthesis of four biosourced unsaturated polyesters made from chiral terpene‐based diols and esters of renewable diacids. The resulting materials harbor a bicyclic pinene ring in their backbones which leads to enhanced thermal properties while still conferring susceptibility to enzyme hydrolysis for chains having a cis alkene.
Ganapathy Ranjani +4 more
wiley +1 more source
On Extended Adjacency Index with Respect to Acyclic, Unicyclic and Bicyclic Graphs
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

