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

As mathematical abstractions go, graphs are among the simplest. Scatter a bunch of points in a plane. Connect some of them with lines. That’s all a graph is. And yet they are incredibly powerful. They ...

1 School of Physics and Astronomy, University of Glasgow, Glasgow, United Kingdom 2 School of Computing, Newcastle University, Newcastle upon Tyne, United Kingdom Connected networks are a fundamental ...

This project uses Processing and Graph Theory to generate random Graph patterns and states if they are Euler or Hamilton Graphs. We worked on this as part of our project submission for Graph Theory in ...

At 21, Ashwin Sah has produced a body of work that senior mathematicians say is nearly unprecedented for a college student. The proof joined a long list of mathematical results that Sah, who turned 21 ...

Some might say mathematicians speak their own language. But walk into at least one mathematics professor’s office at the University of California San Diego and you’ll see a whiteboard full of ...

This is an account of Jayme's contributions to Graph Theory and Computer Science. Due to restrictions in length, it is not possible to provide an in-depth coverage of every aspect of Jayme's extensive ...