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.
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’
Indulal,G; Vijayakumar,A(Department of Mathematics, 2008)
[+]
[-]
Abstract:
Eigenvalue of a graph is the eigenvalue of its adjacency matrix. The energy of a graph is the
sum of the absolute values of its eigenvalues. In this note we obtain analytic expressions for the
energy of two classes of regular graphs.
Aparna,Lakshmanan S; Vijayakumar,Ambat(Department of Mathematics, 2000)
[+]
[-]
Abstract:
In this paper, we study the domination number, the global dom
ination number, the cographic domination number, the global co
graphic domination number and the independent domination number
of all the graph products which are non-complete extended p-sums
(NEPS) of two graphs.
Gopalapillai,Indulal; Ivan,Gutman; Vijayakumar,Ambat(Department of Mathematics, August 25, 2007)
[+]
[-]
Abstract:
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.
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.
Krishnamoorthy,A; Vishwanath, Narayanan C; Deepak,T G(Korean Society for Computational & Applied mathematics, 2007)
[+]
[-]
Abstract:
In this paper, we study a k-out-of-n system with single server
who provides service to external customers also. The system consists of
two parts:(i) a main queue consisting of customers (failed components of
the k-out-of-n system) and (ii) a pool (of finite capacity M) of external
customers together with an orbit for external customers who find the pool
full. An external customer who finds the pool full on arrival, joins the orbit
with probability
and with probability 1−
leaves the system forever. An
orbital customer, who finds the pool full, at an epoch of repeated attempt,
returns to orbit with probability (< 1) and with probability 1 − leaves
the system forever. We compute the steady state system size probability.
Several performance measures are computed, numerical illustrations are
provided.
We define a new graph operator called the P3 intersection graph,
P3(G)- the intersection graph of all induced 3-paths in G. A characterization
of graphs G for which P-3 (G) is bipartite is given . Forbidden
subgraph characterization for P3 (G) having properties of being
chordal , H-free, complete are also obtained . For integers a and b
with a > 1 and b > a - 1, it is shown that there exists a graph G
such that X(G) = a, X(P3( G)) = b, where X is the chromatic number
of G. For the domination number -y(G), we construct graphs G such
that -y(G) = a and -y (P3(G)) = b for any two positive numbers a > 1
and b. Similar construction for the independence number and radius,
diameter relations are also discussed.
Indulal,G; Vijayakumar,Ambat(Department of Mathematics, 2002)
[+]
[-]
Abstract:
Two graphs G and H are Turker equivalent if they have the same set of Turker angles.
In this paper some Turker equivalent family of graphs are obtained.
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.
In this note,the (t) properties of five class are studied. We proved that the classes of cographs and clique perfect graphs without isolated vertices satisfy the (2) property and the (3) property, but do not satisfy the (t) property for tis greater than equal to 4. The (t) properties of the planar graphs and the perfect graphss are also studied . we obtain a necessary and suffieient conditions for the trestled graph of index K to satisfy the (2) property