Advertisement

Oriented Diameter of Star Graphs

Conference paper
  • 548 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 12016)

Abstract

An orientation of an undirected graph G is an assignment of exactly one direction to each edge of G. Converting two-way traffic networks to one-way traffic networks and bidirectional communication networks to unidirectional communication networks are practical instances of graph orientations. In these contexts minimising the diameter of the resulting oriented graph is of prime interest.

The n-star network topology was proposed as an alternative to the hypercube network topology for multiprocessor systems by Akers and Krishnamurthy [IEEE Trans. on Computers (1989)]. The n-star graph \(S_n\) consists of n! vertices, each labelled with a distinct permutation of [n]. Two vertices are adjacent if their labels differ exactly in the first and one other position. \(S_n\) is an \((n-1)\)-regular, vertex-transitive graph with diameter \(\lfloor 3(n-1)/2\rfloor \). Orientations of \(S_n\), called unidirectional star graphs and distributed routing protocols over them were studied by Day and Tripathi [Information Processing Letters (1993)] and Fujita [The First International Symposium on Computing and Networking (CANDAR 2013)]. Fujita showed that the (directed) diameter of this unidirectional star graph \(\overrightarrow{S_n}\) is at most \(\lceil 5n/2\rceil + 2\).

In this paper, we propose a new distributed routing algorithm for the same \(\overrightarrow{S_n}\) analysed by Fujita, which routes a packet from any node s to any node t at an undirected distance d from s using at most \(\min \{4d+4, 2n+4\}\) hops. This shows that the (directed) diameter of \(\overrightarrow{S_n}\) is at most \(2n+4\). We also show that the diameter of \(\overrightarrow{S_n}\) is at least 2n when \(n \ge 7\), thereby showing that our upper bound is tight up to an additive factor.

Keywords

Strong orientation Oriented diameter Star graphs 

References

  1. 1.
    Akers, S.B., Krishnamurthy, B.: A group-theoretic model for symmetric interconnection networks. IEEE Trans. Comput. 38(4), 555–566 (1989)MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Robbins, H.E.: A theorem on graphs, with an application to a problem of traffic control. Am. Math. Monthly 46(5), 281–283 (1939)zbMATHCrossRefGoogle Scholar
  3. 3.
    Chvátal, V., Thomassen, C.: Distances in orientations of graphs. J. Comb. Theory Ser. B 24(1), 61–75 (1978)MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    Day, K., Tripathi, A.: Unidirectional star graphs. Inf. Process. Lett. 45(3), 123–129 (1993)MathSciNetzbMATHCrossRefGoogle Scholar
  5. 5.
    Eggemann, N., Noble, S.D.: Minimizing the oriented diameter of a planar graph. Electron. Notes Discrete Math. 34, 267–271 (2009)MathSciNetzbMATHCrossRefGoogle Scholar
  6. 6.
    Konig, J.-C., Krumme, D.W., Lazard, E.: Diameter-preserving orientations of the torus. Networks 32(1), 1–11 (1998)MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    Cheng, E., Lipman, M.J.: Unidirectional (n, k)-star graphs. J. Interconnect. Netw. 3(01n02), 19–34 (2002)CrossRefGoogle Scholar
  8. 8.
    Dankelmann, P., Guo, Y., Surmacs, M.: Oriented diameter of graphs with given maximum degree. J. Graph Theory 88(1), 5–17 (2018)MathSciNetzbMATHCrossRefGoogle Scholar
  9. 9.
    Fomin, F.V., Matamala, M., Rapaport, I.: Complexity of approximating the oriented diameter of chordal graphs. J. Graph Theory 45(4), 255–269 (2004)MathSciNetzbMATHCrossRefGoogle Scholar
  10. 10.
    Fomin, F.V., Matamala, M., Prisner, E., Rapaport, I.: AT-free graphs: linear bounds for the oriented diameter. Discrete Appl. Math. 141(1–3), 135–148 (2004)MathSciNetzbMATHCrossRefGoogle Scholar
  11. 11.
    Chou, C.-H., Du, D.H.C.: Uni-directional hypercubes. In: Proceedings of Supercomputing 1990, pp. 254–263. IEEE (1990).  https://doi.org/10.1109/SUPERC.1990.130028
  12. 12.
    Akers, S.B.: The star graph: an attractive alternative to the n-cube. In: Proceedings of International Conference on Parallel Processing (1987)Google Scholar
  13. 13.
    Fujita, S.: On oriented diameter of star graphs. In: 2013 First International Symposium on Computing And Networking (CANDAR), pp. 48–56. IEEE (2013).  https://doi.org/10.1109/CANDAR.2013.16
  14. 14.
    Ajish Kumar, K.S., Rajendraprasad, D., Sudeep, K.S.: Oriented diameter of star graphs, arXiv preprint arXiv:1911.10340

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Department of Electronics and Communication EngineeringNational Institute of Technology CalicutKozhikodeIndia
  2. 2.Department of Computer Science and EngineeringIndian Institute of Technology PalakkadPalakkadIndia
  3. 3.Department of Computer Science and EngineeringNational Institute of Technology CalicutKozhikodeIndia

Personalised recommendations