Antibandwidth of a Graph

  • Aditya Shastry Department of Mathematics and Statistics, Banasthali University, Banasthali -304022, Rajasthan, India.
  • Nidhi Khandelwal Department of Mathematics and Statistics, Banasthali University, Banasthali -304022, Rajasthan, India.

References

Z Miller and D Pritikin, On the separation number of graphs, Networks, vol. 19, pp. 651-666, 1989.
[2] F T Leighton, B M Maggs and S B Rao, Packet routing and job-shop scheduling in O (congestion + Dilation) steps, Combinatorica, vol. 14, pp. 167-180, 1994.
[3] J Y-T Leung, O Vornberger and J D Witthoff, On some variants of the bandwidth minimization problem, SIAM Journal on Computing, vol. 13, pp. 650-667, 1984.
[4] Y Lin and J Yuan, “The dual bandwidth problem for graphs,” Journal of Zhengzhou University, vol. 35, 2003.
[5] F Harary, Graph theory, Massachusetts: Addison-Wesley, 1969.
Published
2012-08-06
How to Cite
SHASTRY, Aditya; KHANDELWAL, Nidhi. Antibandwidth of a Graph. Mapana - Journal of Sciences, [S.l.], v. 11, n. 4, p. 59-64, aug. 2012. ISSN 0975-3303. Available at: <http://journals.christuniversity.in/index.php/mapana/article/view/280>. Date accessed: 27 may 2019. doi: https://doi.org/10.12723/mjs.23.4.
Section
Research Articles

Keywords

Vertex independent number, chromatic number, vertex connectivity, antibandwidth.