Results 51 to 60 of about 1,782 (193)

Bounds and extremal graphs of second reformulated Zagreb index for graphs with cyclomatic number at most three

open access: yesKuwait Journal of Science, 2021
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‐Time Meal Delivery Assisted by Drone Resupply

open access: yesNaval 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

Inverses of bicyclic graphs

open access: yesThe 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

open access: yesDiscrete 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

open access: yesNetworks, 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

open access: yesPolymer 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

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

The inertia of unicyclic graphs and bicyclic graphs

open access: yesDiscussiones Mathematicae - General Algebra and Applications, 2013
Let G be a graph with n vertices and (G) be the matching number of G. The inertia of a graph G, In(G) = (n+;n ;n0) is an integer triple specifying the numbers of positive, negative and zero eigenvalues of the adjacency matrix A(G), respectively. Let (G) = n0 denote the nullity of G (the multiplicity of the eigenvalue zero of G).
openaire   +1 more source

How Aligned Are Citizen Preferences With the 15‐Minute Cities Paradigm? An International Survey and K‐Means Clustering Study

open access: yesSustainable Development, EarlyView.
ABSTRACT This study investigates how citizens' mobility preferences align with the principles of the 15‐Minute City (15mC), addressing three research questions: what access times and transport modes citizens consider acceptable, whether mobility preference can be clustered, and which services are perceived incompatible with the 15mC.
Maria Perales‐Eguiluz   +3 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

Home - About - Disclaimer - Privacy