One of the most amazing and wonderful mathematicians of all time is Srinivasa
Ramanujan. He provides a shining example for each of us in at least two
important ways. First, his magical genius has provided mathematicians for
the last one hundred years with wonderful research directions that have greatly
enriched our understanding of many areas of Mathematics. Second, he has
shown us that someone born in poverty can achieve success beyond our wildest
dreams. The world is a better place because he lived”.
This article is on the life and works of
Dr. Kalam as a student, a teacher, a team
leader, the President of India and above
all a great visionary. It is also expected to
be a sequel to the one entitled ‘A meeting
with the missile man’
The concept of convex extendability is introduced to answer the problem of finding the smallest
distance convex simple graph containing a given tree. A problem of similar type with respect
to minimal path convexity is also discussed.
Indulal,G; Vijayakumar,A(Springer, October , 2007)
[+]
[-]
Abstract:
The energy of a graph G is the sum of the absolute values of its eigenvalues. In this
paper, we study the energies of some classes of non-regular graphs. Also the spectrum
of some non-regular graphs and their complements are discussed.
Lakshmanan,Aparna; Rao, S B; Vijayakumar,A(February 4, 2010)
[+]
[-]
Abstract:
Abstract. The paper deals with graph operators-the Gallai graphs and the anti-Gallai
graphs. We prove the existence of a finite family of forbidden subgraphs for the Gallai graphs
and the anti-Gallai graphs to be H-free for any finite graph H. The case of complement
reducible graphs-cographs is discussed in detail. Some relations between the chromatic
number, the radius and the diameter of a graph and its Gallai and anti-Gallai graphs are
also obtained.
The D-eigenvalues of a graph G are the eigenvalues of its distance matrix D, and the
D-energy ED(G) is the sum of the absolute values of its D-eigenvalues. Two graphs are
said to be D-equienergetic if they have the same D-energy. In this note we obtain bounds
for the distance spectral radius and D-energy of graphs of diameter 2. Pairs of equiregular
D-equienergetic graphs of diameter 2, on p = 3t + 1 vertices are also constructed.
this paper, the median and the antimedian of cographs are
discussed. It is shown that if G, and G2 are any two cographs, then there is a
cograph that is both Eulerian and Hamiltonian having Gl as its median and G2
as its antimedian. Moreover, the connected planar and outer planar cographs
are characterized and the median and antimedian graphs of connected, planar
cographs are listed.
The eigenvalue of a graph is the eigenvalue of its adjacency matrix . A graph
G is integral if all of its cigenvalues are integers. In this paper some new
classes of integral graphs are constructed.