Identifying and quantifying dissimilarities among graphs is a fundamental and challenging problem of practical importance in many fields of science. Current methods of network comparison are limited ...

The degree distance of a connected graph G with vertex set V(G) is defined as $\sum\limits_{u \in V\left( G \right)} {{d_G}} \left( u \right){D_G}\left( u \right)$, where dG(u) is the degree of vertex ...

Let G be a directed graph such that every edge e of G is associated with a positive integer, called the index of e. Then G is called a network graph if, at every vertex v of G, the sum of the indices ...

Some applications are so inherently complicated that it is difficult to dig through the many layers of connected algorithms to expose the parts of the code ripe for optimization. This makes them a ...