ABSTRACT: Let G=( V,E ) be a graph. The first Zagreb index of a graph G is defined as ∑ u∈V d G 2 ( u ) , where d G ( u ) is the degree of vertex u in G . In this paper, we obtain two lower bounds ...

ABSTRACT: Let G=( V,E ) be a graph. The first Zagreb index of a graph G is defined as ∑ u∈V d G 2 ( u ) , where d G ( u ) is the degree of vertex u in G . In this paper, we obtain two lower bounds ...

Abstract: Two-echelon vehicle routing problem (2E-VRP) is an NP-hard combinatorial optimization problem and a basic mathematical model of modern city logistics. While it is difficult to obtain the ...

Now that Mermaid uses Cytoscape.js for the Mindmap diagrams it will be possible to add support for the graph theory graphs. Something like the examples in the https ...

In this study, we propose a method for navigating the choice of treatment for stress urinary incontinence (SUI) and urgency urinary incontinence (UUI) using graph theory in discrete mathematics. Our ...

DPABINet, a sophisticated enhancement of the DPABI software suite, streamlines the intricate analysis of brain networks through fMRI data, providing researchers of all expertise levels with ...

Eligibility: All funded participants must be U.S. Citizens or permanent residents and all participants must be undergraduates (not have received a bachelor's degree) in the fall of 2024. Women, ...

In October 2015 my time training mathematics teachers at a French high school in Port Vila, Vanuatu, was coming to an end. The principal invited me to share kava, a traditional drink in the country.