%0 Journal Article
%T Sharp Upper Bounds for Multiplicative Degree Distance of Graph Operations
%A R. Muruganandam
%A R. S. Manikandan
%A M. Aruvi
%J Open Access Library Journal
%V 4
%N 7
%P 1-18
%@ 2333-9721
%D 2017
%I Open Access Library
%R 10.4236/oalib.1102987
%X <div style="text-align:justify;">
	<span style="line-height:1.5;">In this paper, mul</span><span style="line-height:1.5;">tiplicative version of degree
distance of a graph is defined and tight upper bounds of the graph operations
have been found.</span> 
</div>
%K Join
%K Disjunction
%K Composition
%K Symmetric Difference
%K Multiplicative Degree Distance
%K Zagreb Indices and Coindices
%U http://www.oalib.com/paper/5272585