Abstract :
Let G be a finite connected simple graph. The degree distance index ) (G DD
of G is defined as ? ? ? ) ( } , { )) ( deg ) ( )(deg , (
G V v u v G u G v u G d , where ) ( deg u G is the
degree of vertex u in G and ) , ( v u G d is the distance between two vertices u and v in G .
In this paper, we determine the degree distance of the complement of arbitrary Mycielskian
graphs. It is well known that almost all graphs have diameter two. We determine this graphical
invariant for the Mycielskian of graphs with diameter two.
