The Wiener number of powers of the Mycielskian

  title={The Wiener number of powers of the Mycielskian},
  author={Rangaswami Balakrishnan and S. Francis Raj},
  journal={Discuss. Math. Graph Theory},
The Wiener number of a graph G is dened as 1 P u;v2V (G) d(u; v), d the distance function on G. The Wiener number has important applications in chemistry. We determine a formula for the Wiener number of an important graph family, namely, the Mycielskians (G) of graphs G. Using this, we show that for k 1, W ( (S k n)) W ( (T k n)) W ( (P k n )), where Sn, Tn and Pn denote a star, a general tree and a path on n vertices respectively. We also obtain Nordhaus-Gaddum type inequality for the Wiener… 
2 Citations

Figures from this paper

Self-transformation of trees with a bounded degree of vertices to minimize or maximize the Wiener index

  • I. Burdonov
  • Mathematics, Computer Science
    Proceedings of the Institute for System Programming of RAS
  • 2019
It is shown that any other tree can be obtained from any tree using only atomic transformations, and the tasks of maximizing and minimizing the Wiener index of a tree with a bounded degree of vertices without changing the set of its vertices are considered.

Degree and Distance Based Topological Indices of Graphs



The Wiener number of Kneser graphs

This work determines the Wiener number of an important family of graphs, namely, the Kneser graphs, which have important applications in chemistry and mathematics.

Circular chromatic numbers of Mycielski's graphs

Circular chromatic number for iterated Mycielski graphs

Wiener index of graphs with more than one cut-vertex

Circular Chromatic Number and Mycielski Graphs

It is shown that if the complement of G is non-hamiltonian, then χc(G)=χ(G), which implies the known results of Chang, Huang, and Zhu.

Wiener Index of Hexagonal Systems

The Wiener index W is the sum of distances between all pairs of vertices of a (connected) graph. Hexagonal systems (HS's) are a special type of plane graphs in which all faces are bounded by

A Sharp Lower Bound for the Wiener Index of a Graph

A sharp lower bound for W(G) of an arbitrary graph in terms of the order, size and diameter of G is obtained.

Circular chromatic number and Mycielski construction

It is proved that for any integer t ≥ 1, there exists an integer n such that for all k ≥ n χc(M (Kk))) = χ(M(Kk)).


On Complementary Graphs