Involve: A Journal of Mathematics

  • Involve
  • Volume 2, Number 3 (2009), 289-295.

Maximum minimal rankings of oriented trees

Sarah Novotny, Juan Ortiz, and Darren Narayan

Full-text: Open access

Abstract

Given a graph G, a k-ranking is a labeling of the vertices using k labels so that every path between two vertices with the same label contains a vertex with a larger label. A k-ranking f is minimal if for all vV(G) we have f(v) g(v) for all rankings g. We explore this problem for directed graphs. Here every directed path between two vertices with the same label contains a vertex with a larger label. The rank number of a digraph D is the smallest k such that D has a minimal k-ranking. The arank number of a digraph is the largest k such that D has a minimal k-ranking. We present new results involving rank numbers and arank numbers of directed graphs. In 1999, Kratochvíl and Tuza showed that the rank number of an oriented of a tree is bounded by one greater than the rank number of its longest directed path. We show that the arank analog does not hold. In fact we will show that the arank number of an oriented tree can be made arbitrarily large where the largest directed path has only three vertices.

Article information

Source
Involve, Volume 2, Number 3 (2009), 289-295.

Dates
Received: 18 August 2008
Revised: 29 April 2009
Accepted: 3 June 2009
First available in Project Euclid: 20 December 2017

Permanent link to this document
https://projecteuclid.org/euclid.involve/1513799163

Digital Object Identifier
doi:10.2140/involve.2009.2.289

Mathematical Reviews number (MathSciNet)
MR2551126

Zentralblatt MATH identifier
1177.05044

Subjects
Primary: 05C15: Coloring of graphs and hypergraphs 05C20: Directed graphs (digraphs), tournaments

Keywords
$k$-ranking ordered coloring oriented trees

Citation

Novotny, Sarah; Ortiz, Juan; Narayan, Darren. Maximum minimal rankings of oriented trees. Involve 2 (2009), no. 3, 289--295. doi:10.2140/involve.2009.2.289. https://projecteuclid.org/euclid.involve/1513799163


Export citation

References

  • H. L. Bodlaender, J. S. Deogun, K. Jansen, T. Kloks, D. Kratsch, H. Müller, and Z. Tuza, “Rankings of graphs”, SIAM J. Discrete Math. 11:1 (1998), 168–181.
  • D. Dereniowski, “Rank coloring of graphs”, pp. 79–93 in Graph colorings, edited by M. Kubale, Contemp. Math. 352, Amer. Math. Soc., Providence, RI, 2004.
  • D. Dereniowski, Parallel scheduling by graph ranking, Ph.D. thesis, PG WETI, Gdańsk, 2006.
  • D. Dereniowski and A. Nadolski, “Vertex rankings of chordal graphs and weighted trees”, Inform. Process. Lett. 98:3 (2006), 96–100.
  • R. Flórez and D. A. Narayan, “An optimal ranking characterization of oriented paths and cycles”, 2009. Submitted for publication.
  • J. Ghoshal, R. Laskar, and D. Pillone, 97e:05110
  • J. Ghoshal, R. Laskar, and D. Pillone, “Further results on minimal rankings”, Ars Combin. 52 (1999), 181–198.
  • S.-y. Hsieh, “On vertex ranking of a starlike graph”, Inform. Process. Lett. 82:3 (2002), 131–135.
  • G. Isaak, R. Jamison, and D. A. Narayan, “Greedy rankings and the arank number”, Information Processing Letters 109:15 (2009), 825–827.
  • R. E. Jamison, “Coloring parameters associated with rankings of graphs”, Congr. Numer. 164 (2003), 111–127.
  • V. Kostyuk and D. A. Narayan, “Maximum minimal rankings of cycles”, Ars Combinatoria. To appear.
  • V. Kostyuk, D. A. Narayan, and V. A. Williams, “Minimal rankings and the arank number of a path”, Discrete Math. 306:16 (2006), 1991–1996. http://www.emis.de/cgi-bin/MATH-item?1101.05040Zbl 1101.05040
  • J. Kratochvíl and Z. Tuza, “Rankings of directed graphs”, SIAM J. Discrete Math. 12:3 (1999), 374–384.
  • R. Laskar and D. Pillone, “Theoretical and complexity results for minimal rankings”, J. Combin. Inform. System Sci. 25:1-4 (2000), 17–33.
  • R. Laskar and D. Pillone, “Extremal results in rankings”, Congr. Numer. 149 (2001), 33–54.
  • C. E. Leiserson, “Area efficient graph layouts for VLSI\kern1pt”, pp. 270–281 in Proc. 21st Ann. IEEE Symposium FOCS, 1980.
  • S. Novotny, J. Ortiz, and D. A. Narayan, “Minimal $k$-rankings and the rank number of $P\sp 2\sb n$”, Inform. Process. Lett. 109:3 (2009), 193–198.
  • A. Sen, H. Deng, and S. Guha, “On a graph partition problem with application to VLSI layout”, Inform. Process. Lett. 43:2 (1992), 87–94.
  • P. de la Torre, R. Greenlaw, and T. Przytycka, “Optimal tree ranking is in NC”, Parallel Processing Letters 2:1 (1992), 31–41.