Results 51 to 60 of about 167 (150)
Degree distance of unicyclic and bicyclic graphs
Discrete Applied Mathematics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aleksandar Ilic +4 more
openaire +1 more source
Boronic Acid Inhibitors of β‐Lactamases: A Promising Strategy Against Antimicrobial Resistance
Medicinal Research Reviews, EarlyView.ABSTRACT The rise of antimicrobial resistance (AMR) poses a critical threat to global health, mostly due to the proliferation of β‐lactamases, a class of enzymes responsible for the inactivation of β‐lactam antibiotics. Among the most promising strategies to restore β‐lactam efficacy is the use of β‐lactamase inhibitors (BLIs), with boronic acid ...
Nicolò Santi +4 more
wiley +1 more source
Extremal Bicyclic Graphs with Respect to Permanental Sums and Hosoya Indices
AxiomsGraph polynomials is one of the important research directions in mathematical chemistry. The coefficients of some graph polynomials, such as matching polynomial and permanental polynomial, are related to structural properties of graphs.
Tingzeng Wu, Yinggang Bai, Shoujun Xu
doaj +1 more source
On‐Time Meal Delivery Assisted by Drone Resupply
Naval Research Logistics (NRL), EarlyView.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
$G$-designs for the connected triangular bicyclic graphs with nine edges [PDF]
Transactions on CombinatoricsA $G$-design of order $n$ is a decomposition of the complete graph $K_n$ into isomorphic copies of $G$. We show that if $G$ is a connected bicyclic graph with nine edges containing two triangles, a $G$-design of order $n$ exists whenever $n \equiv 0,1 ...
Bryan Freyberg +4 more
doaj +1 more source
The Upper Bound of the Edge Mostar Index with Respect to Bicyclic Graphs
Mathematics, 2023 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
The Electronic Journal of Linear Algebra, 2017 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
On the index of bicyclic graphs with perfect matchings
Discrete Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
AnAn Chang, Feng Tian, Aimei Yu
openaire +2 more sources
Allocation of Indivisible Items With a Common Preference Graph: Minimizing Total Dissatisfaction
Networks, EarlyView.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
Polymer International, EarlyView.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