International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169

Volume: 5 Issue: 5 417 419

_______________________________________________________________________________________________
Miscellaneous Properties Of Full Graphs

Shadi Ibrahim Khalaf *, Veena Mathad and Sultan Senan Mahde

Department o f Studies in Mathematics, U niversit y o f Mysore, Man-

asagangotri, Mysuru - 570 006, I N D I A
E-mail address: shadikhalaf1989@hotmail.com

Department o f Studies in Mathematics, U niversit y o f Mysore, Man-

asagangotri, Mysuru - 570 006, I N D I A
E-mail address: veena-mathad@rediffmail.com

Department o f Studies in Mathematics, U niversit y o f Mysore, Man-

asagangotri, Mysuru - 570 006, I N D I A
E-mail address: sultan.mahde@gmail.com

Abstract. In this paper, we stablish miscellaneous properties of the full graph of a graph. We obtain characterizations
of this graph. Also, we prove that for any connected graph G, the full graph of G is not separable.

Keywords and phrases. Full graph, Block graph, Line graph, Middle graph, Separable.
__________________________________________________*****_________________________________________________

1. Introduction smallest cycle in G. The chromatic number (G) of a

All graphs considered here are nite, undirected graph G is the minimum number of colors required to
without loops and multiple edges. For all denitions assign to the vertices of G in such a way that no two
and notations not given in this paper, we refer to [4]. adjacent vertices of G receive the same color [4].
A graph G with p vertices and q edges is called a (p, q) A graph G is called a null graph (or empty graph) if
graph, the number p is referred to as the order of a E(G) is empty, a null graph of order p is denoted by Np
graph G and q is referred to as the size of a graph G [9]. A graph G is called planer if it can be drawn in the
[4]. plane without any intersecting edges [3].
If B = {u1, u2, u3, ..., ur, r2} is a block of a graph G, The eccentricity e(v) of a vertex v in a connected
then we say that vertex u1 and block B are incident graph G is dened as e(v)=max{d(v, u)|u V (G)}
with each other, as are u2 and block B and so on. If B
where d(v, u) is the distance between u and v. The
= {e1, e2, e3, ..., es, s1} is a block of a graph G, then
radius r(G) is the minimum eccentricity among the
we say that edge e1 and block B are incident with each
vertices of G, and the diameter d(G) is the maximum
other, as are e2 and B and so on. If two distinct blocks
eccentricity [4].
B1 and B2 are incident with a common cut vertex then,
A wheel graph Wp of order p, sometimes simply called
they are adjacent blocks [6]. The vertices, edges and
a p-wheel is a graph that contains a cycle of order p
blocks of a graph are called its members. A cut vertex
1, and for which every vertex in the cycle is joined to
of a connected graph G is a vertex whose removal
one other vertex in the center [4]. A cycle passing
increases the number of components of G [4].
through all the vertices of a graph is called a hamil-
A set D of vertices in a graph G is called dominating
tonian cycle. A graph containing a hamiltonian cycle is
set of G if every vertex in V D is adjacent to some
called a hamil- tonian graph [4].
vertex in D, the minimum cardinality of a dominating
The line graph L(G) of a graph G is the graph whose
set in G is called the domination number (G) of a
vertex set is the set of edges of G and two vertices are
graph G [5]. A dominating set D is a total dominating
adjacent if the corresponding edges are adjacent in G
set if the induced subgraph D has no isolated vertices,
[4].
the minimum cardinality of a total dominating set in G
The block graph B(G) of a graph G is the graph whose vertex
is called the total domination number t(G) of G [5].
set is the set of blocks of G and two vertices are adjacent if the
The girth of a graph G, denoted girth(G) is size of the
417
IJRITCC | May 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 5 417 419
_______________________________________________________________________________________________
corresponding blocks are incident with a cut vertex in G [4]. vertex v in C p, let v be the corresponding vertex in F
The full graph F (G) of a graph G is the graph whose set of (C p), v is adjacent to two vertices corresponding to two
vertices is the union of the set of vertices, edges and blocks of
vertices in C p , v is adjacent to two vertices which
G, in which two vertices are adjacent if the corresponding
members of G are adjacent or one corresponds to a vertex and corresponds to two edges in C p , also v is adjacent to a
the other to an edge incident with it or one corresponds to a vertex corresponding to a block in C p , then deg( v ) = 5.
block B and other to a vertex v of G and v is in B or one Theorem 2.2. For any connected graph G, F (G) has no
corresponds to a block B and the other to an edge e of G and cut ver- tices.
e is in B [7]. Many other graph valued functions in graph
Proof. Let G be a connected graph, rst let v be any
theory were studied, for example, in [2, 4, 8, 10].
vertex in F (G) which corresponds to a vertex or an edge of
The following results will be useful in the proof of our
G, and let u, w be any two distinct vertices of F (G) which
results.
are di erent from v, if u, w correspond to adjacent blocks in
Theorem 1.1. [4] A vertex v of a connected graph G with
G then u, w are adjacent, otherwise there exists a u w path
at least three vertices is a cut vertex of G if and only if there
starting from u passing through some vertices which correspond
exist vertices u and w of G distinct from v such that v is in to blocks of G, this means v is not on this path. By Theorem
every u w path in G. Theorem 1.2. [4] A nontrivial 1.1, v is not a cut vertex of F (G). Next, let v be any vertex
graph is bipartite if and only if all its cycles are even. in F (G) which corresponds to a block of G, if G has one
block then F (G) v is total graph of G which is connected
2. Miscellaneous properties of full graph since G is connected. Now if G has more than one block
Re ma r k 2.1. For any graph G, the block graph B(G) of a then in F (G) v there is a vertices which correspond to the
graph G is a subgraph of F (G). blocks of G and the total graph (vertices which corresponding
Re ma r k 2.2. For any graph G, the line graph of G is a to vertices and edges of G), since G is connected then total
subgraph of F (G). graph of G is connected, also each one of the vertices
corresponding to the blocks of G is adjacent with at least one
Theorem 2.1. For any cycle C p, the wheel W2p+1 is a
vertex from the vertices which correspond to a vertices of G,
spanning subgraph of F (C p).
this means that F (G) v is connected, then v isnt a cut
Proof. Suppose G is a cycle C p, then the number of blocks vertex of G, therefore F (G) has no cut vertex.
is 1, then in F ( C p) there is a vertex v corresponding to this
Corollary 2.3. For any connected graph G, F (G) is not
block and by denition of F (C p) this vertex must be separable.
joined to all vertices corre- sponding to vertices and edges of
Theorem 2.3. For any tree T , if v is a cut vertex, and
C p. So, v will be the center vertex adjacent to all vertices in
deg(v) = n, then in F (T ), deg(v ) = 3n, where v is the
F (C p), and the other vertices of F (C p) form a cycle since any
vertex corresponding to v in F (T ).
vertex corresponding to edge of C p is adjacent to two vertices
Proof. Let v be a cut vertex in a tree T , and deg(v) =
corresponding to vertices of C p and so on, this establishes a
n, this means that v is adjacent to n vertices and incident
wheel W2p+1 .
with n edges in T , since v is a cut vertex and every edge in
Corollary 2.1. For any cycle C p, r ( F (C p)) = d(F ( C p)) T is a block, v lies in n blocks, therefore by the denition
= 2. of F (T ), v is adjacent to n vertices
Corollary 2.2. For any cycle C p , F ( C p) is hamiltonian corresponding to vertices of T , and to n vertices corresponding
graph. to edges of T , and to n vertices corresponding to blocks of T ,
Prop o sitio n 2.1. Let G = (p, q) be a graph which is a block. then deg(v ) = 3n.
Then the maximum degree in F (G) is the degree of the
vertex corresponding to the block of G which (p + q). Theorem 2.4. For any edge in a graph G, with edge degree n,
Proof. Let G be a graph which is a block, then in F (G) the degree of the corresponding vertex in F (G) is n + 3.
there is a vertex v corresponding to this block and v is
adjacent to all vertices in F (G) that corresponds to vertices Proof. If an edge e in G is of edge degree n. Then e is
and edges of G, thus the degree of v is (p + q), which is the adjacent to n edges, say, e1, e2, , en . Let v be a vertex in F
maximum degree in F (G) since |V ( F (G))|=p + q + 1. (G) which is corresponding to e clearly v is adjacent to n
vertices in F (G) corre- sponding to, e1, e2, , en . Also v
Lemma 2.1. If v is a vertex of cycle C p , and v is the is adjacent to two vertices that correspond to vertices incident
corresponding vertex in F (C p), then deg( v ) = 5. with e in G, and v is adjacent to one vertex which is
Proof. Let G be a cycle C p, then deg(v) = 2 for any corresponding to a block B in G and e is in B. This means
418
IJRITCC | May 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 5 417 419
_______________________________________________________________________________________________
v is adjacent to n + 3 vertices in F (G). vertex cor- responding to a block of G is adjacent to all
vertices corresponding to vertices and edges of G that lie in
Theorem 2.5. For any connected graph G = (p, q), F (G) this block. Also the vertices corre- sponding to blocks of G are
is tree if and only if G K1 . connected since G is connected, this means that the vertices
corresponding to blocks of G together are adjacent to all vertices
Proof. Suppose a connected graph G is K1, then in F (G)
of F (G), then they are dominating set of F (G), therefore
there are two vertices one corresponding to the vertex of G
( F (G)) |B|.
and the other one to a block of G, by denition of F (G),
Corollary 2.5. For any connected graph G,
both vertices are adjacent, this establishes P 2, then F (G) is a
t(F (G)) |B|.
tree. Conversely, suppose F (G) is tree, we now prove that G
is K1. On the contrary, assume that connected graph G is Theorem 2.9. For any connected graph G with
not K1, clearly p 2. Then G has a block B. Let vertices |B| 2, ( F (G) ) = 2.
u, v B. Since u, v are incident with B, it implies that Proof. Suppose that G is a connected graph with |B| 2,
the vertices corresponding to B, u, v, form a cycle C 3 in F then there are at least two blocks say, B1, B2, and there are
(G), this means F (G) is not tree, a contradiction. We two distinct vertices v B1, u B2, such that v and u are
conclude that G K1 . not cut vertices. Let v , u , be the vertices in F (G)
Theorem 2.6. If graph G has the path P 2 as a subgraph, then F corresponding to v, u, respectively. Clearly by the denition
(G) is not a bipartite graph. of F (G), v is adjacent only to vertices corresponding to
elements of G lying in B1 and the same is to u in B2. Now in
Proof. Let G be a graph having the path P 2 as a subgraph.
Then G has a block B. Let vertices u, v B. Since u, v
( F (G ) ), v is djacent to all vertices which corresponds to
are incident with B, it implies that the vertices corresponding elements of G that are not in B1, and u is adjacent to all
to B, u, v, form a cycle C 3 in F (G). By Theorem 1.2, F vertices corresponding to elements of G that are not in B2.
(G) is not a bipartite graph.Theorem 2.7. If G has the path This means v , u are dominating ( F (G) ), then ( F (G) )
P 2 as a subgraph, = 2.
girth( F (G)) = 3
. References
Proof. Let G be a graph having the path P 2 as a subgraph, [1] R. Balakrishnan and K. Ranganathan, A Textbook of Graph
then by the proof of Theorem 2.7, F (G) contains a cycle Theory, Springer Science Business Media, New York, USA,
C 3 which is the shortest cycle, then girth( F (G)) = 3. 2012.
[2] B. Basavanagoud and Veena Mathad, Graph equations for line
Prop o sitio n 2.2. If G has the path P 2 as a subgraph, then graphs, blitact graphs and blict graphs, Journal of Discrete
F (G) Mathematical Sciences and Cryp- tography. (2015); 3 (3): 373
has K4 as an induced subgraph . 379.
Proof. Let G be a graph having the path P 2 as a subgraph, [3] J. A. Bondy and U. S. R. Murty, Graph Theory with
then G has a block B which contains one edge e and two Applications, The Macmil- lan Press Ltd, 1976.
[4] F. Harary, Graph Theory, Addison Wesley, Reading Mass, 1969.
vertices say, v, u. Since e, v, u, are incident with B, and v,
[5] T. W. Haynes, S. T. Hedetniemi and P. J. Slater Fundamentals of
u, are incident with e, then the vertices corresponding to u, v, domination in graphs, Morcel Dekker, Inc, 1998.
e, B, form a complete graph K4 in F (G). [6] V. R. Kulli, The semitotal block graph and total-block graph of a
Corollary 2.4. If G has the path P 2 as a subgraph, (F graph, India J. Pure Appl. Math. (1976); 7: 625630.
(G)) 4. [7] V. R. Kulli, On full graphs, Journal of Computer and
Mathematical sciences. (2015); 6(5): 261267.
Theorem 2.8. For any connected graph G, ( F (G)) |B|
[8] V. R. Kulli, On line-block graphs, Iternational Reasearch Journal
where of Pure Al- Gebra. (2015); 5(4): 4044.
|B| is the number of blocks of G. [9] K. K. Meng, D. F. Ming, and T. E. Guan, Introduction to graph
Proof. Let G be a connected graph. The following cases are theory, World Scientic Publishing Co. Pte. Ltd, 5 Toh Tuck
considered. Link, Singapore, 2007.
[10] Veena Mathad, Graph equations for line graphs, middle graphs,
Case1. G has one block, then in F (G) the vertex
semi-splitting block graphs and semiline splitting block graphs,
corresponding to this block is adjacent to all other vertices of
Proceedings of the Jangjeon Mathematical Society. (2011); 14:
F (G). By the denition 209214.
of F (G), in this case (F (G)) = 1 = |B|.
Case2. G has more than one blocks, then in F (G) every
419
IJRITCC | May 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________