INTERNATIONAL JOURNAL OF COMPUTER APPLICATION

ISSUE 2, VOLUME 6 (DECEMBER 2012)

Available online on http://www.rspublication.com/ijca/ijca_index.htm
ISSN: 2250-1797

Wiener Polynomial for Steiner distance of

Corona and Complement graphs
Mary U*, Dr.Arockiaraj PS** and Dr.James Albert A***
*Research Scholar, Karpagam University, Coimbatore and Faculty in the Department of
Mathematics, Nirmala College for Women, Coimbatore 641 018, Tamil Nadu, India
**Department of Mathematics, MEPCO College of Engineering, Sivakasi, Tamil Nadu, India
***Dean, Faculty of Arts, Science & Humanities, Karpagam University, Coimbatore 641021,

Tamil Nadu, India

______________________________________________________________________________
Abstract: In this paper, the Wiener polynomial for Steiner n-distance (; ), for some
graphs such as complete, bipartite, star graphs are studied. The Wiener polynomial for Steiner ndistance of compound graphs 1 . 2 and 1 : 2 are discussed. The Wiener polynomial for Steiner
n-distance of Corona and Complement graphs are derived.
Keywords: Compound graph, Corona graph, Complement graph, Steiner distance, Wiener
polynomial
______________________________________________________________________________
1. Introduction:
A graph (V, E) consists of a finite nonempty set V=V () of p vertices (or points) together
with a set E=E () of q unordered pairs of distinct vertices of V which are known as edges (or
lines). By a graph, we mean a non trivial, finite, undirected connected graph without loops and
multiple edges.
The distance dG (u,v) between the vertices u and v is the length of the shortest path in between
u and v. The eccentricity e(u) = max{ d(u,v): vV()}. The radius r() and the diameter d() of
the graph are defined by r() = min{e(u):uV()} and d() = max{e(u):uV()}
respectively.
For general notation and terminology, we follow Harary [6].
The Steiner distance for a non empty set S V in G, denoted by dG (S), is the size of the smallest
connected subgraph H(S) containing S and the minimal subgraph H(S) is a tree of called the
Steiner tree of S. Thus, Steiner distance of the set S of n distinct vertices is the minimum number

Page 105

INTERNATIONAL JOURNAL OF COMPUTER APPLICATION

ISSUE 2, VOLUME 6 (DECEMBER 2012)
Available online on http://www.rspublication.com/ijca/ijca_index.htm
ISSN: 2250-1797

of edges in a connected sub graph that contains S. If S = 2 then the Steiner distance is the
distance between the two vertices.
If 2 and S = n, then Steiner distance of S will be called Steiner n-distance of S and is
denoted by dG(S). The Steiner n- diameter of a graph G denoted by diamn () or n () is defined
as the maximum Steiner distance of S of n vertices of V(). The total Steiner n-distance
dn () is defined by dn () ={ dG (S) / S V(), S = n }.
The average Steiner n- distance n () of a connected graph is the average distance over all

(G)
subsets S of n vertices in , n () = ;
is the number of subsets having n elements .

The problem of finding n () is NP complete if 2 < < [8] The sharp bounds for n () are
already obtained [4]
2. Preliminaries:
The concept of the Wiener polynomial (; ) of a graph G, was put forward by Hosoya [7]
Definition 2.1: The Wiener polynomial of a graph is defined as (; ) =

()

=0 C(G, k)

where (; ) is the number of pairs of vertices in that are distance k apart and () is the
diameter of the graph .
Gutman [5] established some basic properties of (; ). Saeed [9] obtained the Wiener
polynomial for several classes of graphs and studied some properties of the sequence { (; ) }
which generates the polynomial (; ).
Ali.A.Ali and Walid A.M.Said [1] defined the Wiener polynomial of Steiner n-distance of a
connected graph and derived the same for some special graphs.
Definition 2.2: The Wiener polynomial of Steiner n-distance of a connected graph is defined
as (; )=

()
=1 Cn (G, k)

where 2 , Cn (G, k) is the number of subsets S of n-

distinct vertices with Steiner distance k in the graph , and () is the Steiner n-diameter of .
For n=2, 2 (; ) = ; .
Results 2.3: For a complete graph of order p, ( ; ) =

[1]

If , is the complete bipartite graph of order + , then (, ; ) = + xn +

1
=1

xn-1=

a < b, then

n
+
x +

xn-1 ; if a and b are positive integers and

= 0 [1]

Page 106

INTERNATIONAL JOURNAL OF COMPUTER APPLICATION

ISSUE 2, VOLUME 6 (DECEMBER 2012)
Available online on http://www.rspublication.com/ijca/ijca_index.htm
ISSN: 2250-1797

For , a star graph of order p, ( ; ) = 1 xn + 1 xn-1

3. Wiener polynomial of Steiner n-distance of 1 . 2 and :

Gutman [5] defined the compound graphs 1 . 2 and 1 : 2 as follows:
Definition 3.1: If 1 and 2 are disjoint connected graphs, u1V(1 ) and u2V(2 ), then the
compound graph 1 . 2 is obtained by identifying the vertices u1 and u2 as a vertex w.
Definition 3.2: If 1 and 2 are disjoint connected graphs, u1V(1 ) and u2V(2 ), the
compound graph 1 : 2 is obtained from 1 and 2 by joining them with a new edge between the
two vertices u1 and u2.
The Wiener polynomials of 1 . 2 and 1 : 2 in terms of the Wiener polynomials of 1 and 2 are
given in [5].
Definition 3.3: In a connected graph of order p, let u be a vertex and 2 , then
(, , ) denotes the number of n-subsets S of vertices of containing the vertex u with
dG(S)=k, 1 n(G). For each uV(), 1 (, ; 0) =1. We defined the polynomial
, ; =
for 1

()

= 1

, ; (1)
1

; =

uV (G) Wn (u, G; x).(2)

Theorem 3.4: For 3 1 + 2 1 , (1 . 2 ;x) = (1 ; ) + Wn(2 ;x)+ Wn(u1, G1;x). W2(u2,

2 ;x)+

2
=1 Wr+1 (u1 , G1 ; x)

Wnr (u2 , G2 ; x) + Wn r+1 (u2 , G2 ; x) (3)

Proof: V (1 . 2 ) = [V(1 )-{u1}][V(2 )-{u2}]{w}.

Let S be a subset of V (1 . 2 ) with n vertices such that G1.G2 (S) =k
If S V(1 ),the number of such subsets S with n- vertices is (1 ,k), and the Wiener
polynomial is Wn(1 ;x).
If S V(2 ),the Wiener polynomial is Wn(2 ;x).
If S [V(1 )-{u1}][V(2 )-{u2}] , we consider two cases wS and wS
If wS,let Si ={w}[SV( )] for i=1,2 then 1 .2 ()= 1 (1 )+ 2 (2 ).(4)
Any Steiner tree of 1 . 2 for an n-subset S of vertices containing w is partitioned into a Steiner
tree 1 of 1 containing vertex 1 and a steiner tree 2 of 2 containing a vertex 2 .
It is clear that 1 1 (1 ) k-1 and 2 (2 )=k- 1 (1 ).
The number of such 1 is Cr+1 (u1 , G1 ; i) and the number of corresponding 2 is
Cnr+1 (u2 , G2 ; k i) for r=1,2,.n-1 and for each value of r, i = r, r+1,k-1.
Page 107

INTERNATIONAL JOURNAL OF COMPUTER APPLICATION

ISSUE 2, VOLUME 6 (DECEMBER 2012)
Available online on http://www.rspublication.com/ijca/ijca_index.htm
ISSN: 2250-1797

Therefore for all values of r, the coefficient of xk is

1
= +1

1 , 1 ; . +1 2 , 2 ;

Summing over k, n-1 k (1 . 2 ) and then over r, 1 r n-1, we get

1
=1 +1

1 , 1 ; . +1 2 , 2 ; .

If wS, let = SV( ) for i =1,2 then w1 2 and 1 .2 = 1 (1 ) + 2 (2 ).

The coefficient of xk is

1
= +1

1 , 1 ; . 2 , 2 ;

Summing over k and then over s, 1 s n-2, we get

1
=1 +1

1 , 1 ; . 2 , 2 ; .

Hence by adding the polynomials obtained above we get the required Wiener polynomial.
Corollary 3.5:
Let 1 be a connected graph of order p and let u be a vertex of 1 . If is the compound graph
1 .2 where 2 is the complete graph of order 2 with the vertex set {u,x} then for 3 n p+1,
Wn(;x) = Wn(1 ;x) + x[Wn-1(u, 1 ;x) + Wn(u, 1 ;x)].(4)
Proof: For n 3, we know that Wn(2 ;x) = 0, W2(2 , 2 ;x) = x and Wn(u, 2 ;x) = 0.
By theorem 3.4, we get the required wiener polynomial (4).
Theorem 3.6: For 3 n p1+ p2,
Wn(1 : 2 ;x) = Wn(1 ;x) + Wn(2 ;x) + x[Wn-1(2 , 2 ;x) + Wn(2 , 2 ;x)] +
xWn(1 , 1 ;x)[1+ W2(2 , 2 ;x)] + x

2
=1 +1

1 , 1 ; [ 1 2 , 2 ; +2 2 , 2 ;

+ +1 2 , 2 ; ](5)
Proof: Let 2 = 2 . 2 where V(2 ) ={ 1 , 2 } then

= 0 in which 1 is the identified vertex

of 1 and 2 .
By theorem 3.4, Wn(1 : 2 ;x) = Wn(1 ;x) + Wn(2 ;x) + Wn(1 , 1 ;x). W2(1 , 2 ;x) +
2
=1 +1

1 , 1 ; [Wn-r(1 , 2 ;x)+ Wn-r+1(1 , 2 ;x)].(6)

For any positive integer m 2,

(1 , 2 ;k) = 1 (2, 2 ;k-1) + (2, 2 ;k-1).
Thus Wm (1 , 2 ; ) = x[Wm-1(2, 2 ; )+ Wm(2, 2 ; )].(7)
By corollary 3.5 and using (7), we get the required Wiener polynomial.
4. Wiener polynomial of Steiner distance of corona graph
Definition 4.1: Let 1 and 2 be two simple, connected graphs. The corona 1 02 of two graphs
1 and 2 was defined by Frucht and Harary as the graph obtained by taking one copy
of 1 (which has 1 points) and 1 copies of 2 ,and then joining the ith copy of 2 with G1.
1 02 has 1 (1+2 ) vertices and 1 +1 2 + 1 2 edges.
Page 108

INTERNATIONAL JOURNAL OF COMPUTER APPLICATION

ISSUE 2, VOLUME 6 (DECEMBER 2012)
Available online on http://www.rspublication.com/ijca/ijca_index.htm
ISSN: 2250-1797

Example 4.2:Let 1 = 2 and 2 =1,2

v(1 ) = 2; v(2 ) = 3; e(1 ) = 1; e(2 ) = 2; v(1 02 ) = 2+32=8; v(2 01 ) = 3+32=9

e(1 02 ) = 1+23+23=13; e(2 01 ) =2+31+32=11
Theorem 4.3: For 3 n p1 + p1p2,
(1 02 ; ) = (1 ; )+1 . (2 ; )+

1
=1

1
=1 (2 ; ).

(1 ; )

Proof: Let S be a subset of V(1 02 ) containing n vertices such that 1 02 (S)=k. we consider
the following cases:
(i) S V(1 ).The number of such n- subsets S is (1 ; ) and this produces the polynomial
(1 ; )(1)
(ii) S V(2 ). The number of such subsets S with n- vertices is (2 ; ) and this produces the
polynomial (2 ; )
In 1 02 , we have 1 copies of v(2 ) and this produces the polynomial 1 (2 ; ) (2)
(iii) S {V(1 ) 1 . (2 )},where 1 . (2 ) stands for 1 copies of V(2 ) so that
|S|=|0 |+

=1 |

|=n , where 0 contains vertices of 1 and contains vertices of 2

for i=1,2,. 1 (1 copies)

Page 109

INTERNATIONAL JOURNAL OF COMPUTER APPLICATION

ISSUE 2, VOLUME 6 (DECEMBER 2012)
Available online on http://www.rspublication.com/ijca/ijca_index.htm
ISSN: 2250-1797

If k is the Steiner distance of S, then k=0 +

=1

where are Steiner distance of each copy

of , = 1,2, . 1
It is clear that 1 1 (0 ) 0 and 1 2 ( ) for i=1,2, . 1
The number of such 0 is (

1
1 )

(1 ; 0 ) and the number of such is (2 ; ) for

i=1,2, . 1 , =1,2, .n-1

The coefficient of is

1
= ( 1 1 ) (1 ; 0 ).

1
=1 (2 ; )

Summing over k, n-1 k (1 02 ) and then over r, 1 r n-1,we get

1
=1

1
=1 (2 ; ).

(1 ; )

Hence adding the polynomials obtained in the above cases, we get the Wiener polynomial of
corona graph 1 02 .Similarly the Wiener polynomial of the corona graph 2 01 is
(2 01 ; ) = (2 ; ) + 2 . (1 ; ) +

1
=1

2
=1 (1 ; ).

(2 ; )

5. Wiener polynomial of steiner distance of the complement graph

Definition 5.1: The complement graph of a graph is defined to be the graph which has V()
as its vertex set and two points are adjacent in if and only if they are not adjacent in [1]
Definition 5.2: The graph is said to be a self-complementary graph if is isomorphic to
Definition 5.3: Two graphs 1 = ( 1 ,1 ) and 2 = ( 2 ,2 ) are said to be isomorphic if there
exists a bijection

f: 1 2 such that u, v are adjacent in 1 if and only if f(u), f(v) are adjacent

in 2 . This relation is denoted by 1 2 . The map f is called an isomorphism of 1 to 2 [9]

Remark 5.4: The procedure for obtaining Wiener polynomial of Steiner distance of the
complement graph is same as that of , if is a connected graph
Remark 5.5: If the complement graph is disconnected, Wiener polynomial of Steiner distance
of the complement graph does not exist
Remark 5.6: Relation between the Wiener polynomial of and cannot be found if is
disconnected

Page 110

INTERNATIONAL JOURNAL OF COMPUTER APPLICATION

ISSUE 2, VOLUME 6 (DECEMBER 2012)
Available online on http://www.rspublication.com/ijca/ijca_index.htm
ISSN: 2250-1797

5.7 Example:
If the graph is given by fig (1), its complement graph is given by fig (2)

Wn (G;x) = 5x + 5x2 and Wn ( ;x) does not exist

Theorem 5.8: If is a complete graph , Wiener polynomial of Steiner distance of the
complement graph does not exist
Proof: Let = be a connected graph of n vertices. Every pair of vertices in is adjacent.
The complement graph of is totally disconnected and is regular of degree 0. Hence Wiener
polynomial of Steiner distance of the complement graph does not exist
Corollary 5.9: In a connected graph , if a vertex v is adjacent to every other vertex of , then
the Wiener polynomial of Steiner distance of the complement graph does not exist
Proof: If v is adjacent to every other vertex in , it becomes an isolated vertex in . Hence
becomes disconnected. Thus Wiener polynomial of Steiner distance of the complement graph
does not exist
References:
[1] Ali A. Ali and Walid A.M. Said, ; J.J. Appl. Sci., Vol. 8, No. 2, 64-71., 2006
[2] Chartrand G., and Lesnial L., Graphs and Digraphs, 2nd . Edition; Wadsworth and
Brooks/ Cole, Montery, CA., 1986
[3] Dankelmann P., Oellermann O.R., and Swart H.C., The Average Steiner Distance of
a Graph, J. of Graph Theory., 22(1): 15-22., 1996
[4] Dankelmann P., Oellermann O.R., and Swart H.C., On the Average Steiner Distance
of Certain Classes of Graphs; Discrete Applied Math. 79: 91-103., 1996

Page 111

INTERNATIONAL JOURNAL OF COMPUTER APPLICATION

ISSUE 2, VOLUME 6 (DECEMBER 2012)
Available online on http://www.rspublication.com/ijca/ijca_index.htm
ISSN: 2250-1797

[5] Gutman I., Some Properties of the Wiener Polynomial, Graph Theory Notes of
New York, XXV: 13-18., 1993
[6] Harary Frank, Graph Theory, Narosa Publishing House Tenth Reprint, New Delhi, 2001
[7] Hosoya H., On Some Counting Polynomials, Discrete Applied Math., 19; 239-257., 1988
[8] Garey M.R., and Johnson D.S., Computers and Interactibility: A Guide to the
Theory of NP-Completeness, Freeman and Company, New York., 1979
[9] Mohammed Saeed W.A., Wiener Polynomials of a Graph, Ph. D. Thesis, Mosul
University. , 1999

Page 112