There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality.

Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

I and i

Distance-Regular Graphs

Modern Graph Theory

In order to store a graph or digraph in a computer, we need something other than the diagram or the formal definition. This something is the adjacency matrix, a matrix of O’s and l’s. The l’s correspond to the arcs of the digraph. Certain matrix operations will be seen to correspond to digraph concepts.

Graphs and Matrices

On Zagreb indices, Zagreb polynomials of some nanostar dendrimers

Computation of topological indices of certain networks

On topological indices of certain interconnection networks

Computation of Certain Topological Indices of Nanotubes Covered by C 5 and C 7

On the fault-tolerant metric dimension of convex polytopes

Computation of Certain Topological Indices of Nanotubes

Sakander Hayat

Papers

Computation of topological indices of certain networks

On topological indices of certain interconnection networks

Computation of Certain Topological Indices of Nanotubes Covered by C 5 and C 7

On the fault-tolerant metric dimension of convex polytopes

Computation of Certain Topological Indices of Nanotubes