International Journal of Advances in Science and Technology,

Vol. 3, No.5, 2011

d- CRITICALNESS AND
|
-BLOCK
TRANSFORMATION OF GRAPHS

L. Sudershan Reddy
1
and M. Kamal Kumar
2
1
Department of Mathematics, CMR Institute of Technology, Bangalore, Karnataka, India.
viceprincipal@cmrit.ac.in

2
Department of Mathematics, CMR Institute of Technology, Bangalore, Karnataka, India.
kamal.k@cmrit.ac.in

Abstract

A partition D { }
k
D D D D .., .......... , , ,
3 2 1
= of the vertex set V of G is said to be a domatic
partition or d-partition of G, if each
i
D in D is a dominating set in G. The maximum cardinality
taken over all d-partitions of G is called the domatic number of G and is denoted by d (G).
A graph G is d- Critical if of every edge x in G, ( ) ) (G d x G d < . We define | -Block
Transformation of graph quite similar to block transformation of graphs
| o
G whereo , | &
is 0 or 1. We modify the definition thato , is 1 & | is always 0 i.e. vertices of the block set
) (G U are always not adjacent. Or we can define | -Block Transformation of graph same as block
transformation graph
101
G only with the condition that 0 = | , implies the vertices of block set
) (G U are always not adjacent to each other. In this paper we discuss the d-criticalness of | -Block
Transformation of graphs.

Keywords: Block transformation of graphs, Domination number, domatic number, d-critical graph.

AMS Classification: 05C69.

1. Introduction.

A subset D of the vertex set V of a graph G is called a dominating set in G, if each vertex of G
is either in D or adjacent to at least one vertex in D. A dominating set D in G is minimal dominating
set, if no proper subset of D is a dominating set. The minimum cardinality of all the minimal
dominating sets is called the domination number and is denoted by (G).
A partition D { }
k
D D D D .., .......... , , ,
3 2 1
= of the vertex set V of G is said to be a domatic
partition or d-partition of G, if each
i
D in D is a dominating set in G. The maximum cardinality taken
over all d-partitions of G is called the domatic number of G and is denoted by d (G).
A graph G is d-critical if for every edge x in G, ( ) ( ) G d x G d < .
The study of domatic criticalness is not yet fully explored, but some efforts have been done by
Sudershan Reddy L [4], Walikar H. B and Savita B Basapur [6], Zelinka [7] and D F Rall [3].
November Issue Page 32 of 88 ISSN 2229 5216
International Journal of Advances in Science and Technology,
Vol. 3, No.5, 2011

Let G be a Graph (V, E) with block set { } G of block a is B B G U
i i
: ) ( = . | -Block Transformation
of graphs is defined as ( ) ) ( ), ( G E G V G = with block set ) (G U . And let o , | , are three
variables having the values 1, 0, 1 respectively. The | -Block transformation graph denoted by
) (
1 0 1
G | is the graph having ) ( ) ( G U G V as its vertex set. For any two vertices x and y in
) ( ) ( G U G V we defineo , | as follows,
1. Suppose x, y are in ) (G V , 1 = o , implies x and y are adjacent in G.
2. Suppose x, y are in ) (G U , 0 = | , implies x and y are not adjacent.
3. Suppose ) (G V x e and ) (G U y e , 1 = , implies x and y are incident with each other in
G.
Or we can define | -Block Transformation of graph same as block transformation graph [1]
101
G
only with the condition that 0 = | , implies the vertices of block set ) (G U are always not
adjacent to each other. In this paper we discuss the d-criticalness of | -Block Transformation of
graphs.
G. | -Block Transformation ( )
101
G | .
Figure1. Graph and its | -Block Transformation.
In the above figure
i
u are vertices of the graph and
i
v are the vertices correspond to the block
set ) (G U . The resultant graph is called the | -Block Transformation of the graph.
| -Block Transformation of graphs plays a vital role in management & communication networks, the
incident and non-incident relations of vertices and blocks are used to define various networks.


November Issue Page 33 of 88 ISSN 2229 5216
International Journal of Advances in Science and Technology,
Vol. 3, No.5, 2011

2. Main Results.

Theorem 2.1
A | -Block Transformation of graph ) (
1 0 1
G | of G is d-critical only if G is d-critical.

Proof

Consider a simple connected graph. If the graph is disconnected we consider each component. Given
graph is d-critical i.e. ( ) ) (G d x G d < every edge x in G. let a partition
( )
k
D D D D D D ... .......... , , ,
4 3 2 1
= of vertex set V of G be the maximum partition. Let ) (
1 0 1
G | be
the | -Block Transformation of graph given. It is obvious that G is d-critical and G has no end vertex.
Then G is a single block then the block set ) (G U has one vertex which is adjacent to all the vertices in
G. The partition D set in ) (
1 0 1
G | will become ( )
1 4 3 2 1
, ... .......... , , ,
+
=
k k
D D D D D D D by
removing any edge in G the partition will decrease as the given graph is d-critical and by removing an
edge incident to the vertices in ) (G U will decrease the partition. Hence the proof.

Corollary 2.2

We can construct an infinite d-critical graph starting from a d-critical graph by applying | -Block
Transformation operation to the graph.

G. | -Block Transformation ) (
1 0 1
G | . | -Block Transformation ( ) ) (
1 0 1
G | | .
Figure2. Construction of infinite d-critical graph.
Theorem 2.3
A| -Block Transformation of graph G is d-critical only if G is acyclic and ( ) ( ) 3
101
> G d | .

Proof

Consider a simple connected acyclic graph. If the graph is disconnected (forest) we consider each
component. Given G is acyclic i.e. removal of an edge disconnects the graph. Every edge is a block.
Number of vertices in ) (G U will be equal to number of edges in G. Without loss of generality let
( )
k
v v v v v D .., .......... ,......... , , ,
4 3 2 1 1
= , ( )
k
u u u u u D .., .......... ,......... , , ,
4 3 2 1 2
= &
( )
k
w w w w w D ... .......... , , ,
4 3 2 1 3
= be the domatic partition of ) (
1 0 1
G | where ) (G U u
i
e &
G w v
i i
e , . Removal of an edge incident to
i
v ,
1
D will no longer be a dominating set and the
partition will decrease. Similarly removal of any edge incident to
i i
w v , ,
3 2
, D D will no longer be a
dominating set as they are acyclic in G and partition will decrease. Hence | -Block Transformation of
November Issue Page 34 of 88 ISSN 2229 5216
International Journal of Advances in Science and Technology,
Vol. 3, No.5, 2011

graph G is d-critical if G is acyclic and ( ) ( ) 3
101
= G d | , similarly the result can be generalized
to ( ) ( ) 3
101
> G d | .

Example 2.4

G:
2
P . | -Block Transformation ) (
1 0 1
2
P | .
Figure3. Paths.
Other examples of graph like lobster, spider, centipede etc can be illustrated for
which ( ) ( ) 3
101
= G d | .
COROLLARY 2.5
All | -Block Transformation of a tree with ( ) ( ) 3
101
> G d | is d-critical.
3. Open problem.
3.1. Characterize | -Block Transformation of graph with ( ) 3 > T | .
3.2. Characterize other class of graphs whose | -Block Transformation is d-critical.
3.3. Prove or disprove the converse of the theorem.

References
[1] B.Basavanagoud, H.P. Patil, Jaishri.B.Veeragoundar, On the Block-Transformation Graphs,
Graph-Equations and Diameters, International journal of Advances in Science and
Technology Vol.2, No 2, (2011).
[2] B.Wu.J.Merg, Basic properties of total transformation graphs J. Math., study 34(2), 109-
116,(2001).
[3] Rall D F, Domatically critical and domatically full graphs, Discr. Math 86 81-87, (1990).
[4] Sudershan Reddy. L., The Theory of Domination in graphs & related topics, PhD Thesis,
Karnatak university, (2006).
[5] V.R.Kulli, Semi total-block graph and the total-block graph of a graph, Indian J. Pure. Appl.
math., 625-630, (1976).
[6] Walikar H B and Savita Basapur Deficiency of Non-d-critical graphs, proc. of the National
workshop on graph theory and its applications, Manonmaniam Sundaranar University,
Tirunelveli 235-242, (1996).
[7] Zelinka B, Domatically critical graphs,Czechoslovak Math .U 30 (105) (3) 486-489, (1980).




November Issue Page 35 of 88 ISSN 2229 5216
International Journal of Advances in Science and Technology,
Vol. 3, No.5, 2011



Authors
Dr. L. Sudershan Reddy is been in the academia from the past two decades teaching,
guiding and mentoring under graduate, post graduate and research students. He
obtained his Engineering degree in 1993 and went on to pursue post graduation in
Mathematics and it is a matter of pride to note that he was awarded PhD without VIVA
by Karnatak University. He has rich experience of working on research projects funded
by premier institutions like AICTE & DST. His research papers have been published in
National and International journals. He has been invited to deliver lectures on wide
ranging topics on education, research, mathematics at national and international
conferences. His expertise is effectively being utilized by Govt. and non Govt.
organizations. He is a member of many committees, organizations which are striving to
develop better teaching learning techniques. He has been working with CMRIT since
its inception. Under his able leadership CMRIT has made a mark in the state of Karnataka.


Mr. M. Kamal Kumar obtained his Bachelor degree from St. Joseph College, Masters in
Mathematics from Central College, Bangalore University. Enrolled for PhD in VTU,
working in the field of Domination Theory under the guidance of Dr. L. Sudershan
Reddy His research papers have been published in National and International journals. A
life member of Bangalore Mathematical society, Bangalore University, He was a visiting
professor in AOU, KSA. He has a rich experience of teaching and taught students of
more than 50 nationalities while worked in KSA. He is working as Assistant professor
and Coordinator of Research & Development Centre, Department of
Mathematics, CMR Institute of Technology.

November Issue Page 36 of 88 ISSN 2229 5216