Topological indices play a very important role in the mathematical chemistry. The topological
indices are numerical parameters of a graph. The degree sequence is obtained by …

Starting with the formula for the number of leaves of a tree, two of the authors recently
defined a new graph invariant called Omega denoted by Ω (G) only in terms of a given …

In this paper, by means of the degree sequences (DS) of graphs and some graph theoretical
and combinatorial methods, we determine the algebraic structure of the set of simple …

Topological indices are very important in Mathematics and have a lot of applications in
Molecular Chemistry and many other areas. About the half of them are defined in terms of …

We describe a new method for the random sampling of connected networks with a specified
degree sequence. We consider both the case of simple graphs and that of loopless …

We describe a class of new algorithms to construct bipartite networks that preserves a
prescribed degree and joint-degree (degree–degree) distribution of the nodes. Bipartite …

Subdivision is an important aspect in graph theory which allows one to calculate properties
of some complicated graphs in terms of some easier graphs. Recently, the notion of r …

The high capacity provided by packet-switched networks is supporting the proliferation of
bandwidth intensive multimedia applications which require multicasting capability. As a …

Graphs are a useful tool when it comes to representing structures and dependencies and
are utilised as such in numerous disciplines of science. They appear, for example, as street …

Low-density parity-check (LDPC) codes are error-correcting codes that have been shown to
have good performance approaching Shannon's limit. Although initially developed in the …