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 ...

The intersection of computational physics and machine learning has brought significant progress in understanding complex systems, particularly through neural networks. Graph neural networks (GNNs) ...

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 ...

A team of physicists has created a maze that they claim is the most difficult, using a pattern from the game of chess to make the structure. To the untrained eye, the maze looks like the most ...

A holy grail of theoretical computer science, with numerous fundamental implications to more applied areas of computing such as operations research and artificial intelligence, is the question of ...

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.