Max-optimal and sum-optimal labelings of graphs
Highlights
► We introduce the L_1 norm as a measure of rankings. ► We compare this norm versus measuring the largest label in a ranking. ► For paths and cycles, minimizing the sum over all labels in a ranking leads to a ranking where the largest label is minimized. ► We investigate divergence between the two norms for other families of graphs.
References (21)
- et al.
On chromatic sums and distributed resource allocation
Inform. and Comput.
(1998) On vertex ranking of a starlike graph
Inform. Process. Lett.
(2002)- et al.
Greedy rankings and arank numbers
Inform. Process. Lett.
(2009) - et al.
Vertex ranking of asteroidal triple-free graphs
Inform. Process. Lett.
(1998) - et al.
Minimal rankings and the rank number of
Inform. Process. Lett.
(2009) On sum colorings of graphs
Discrete Appl. Math.
(2003)- et al.
On a graph partition problem with application to VLSI layout
Inform. Process. Lett.
(1992) Theory of Approximation
(1956)- et al.
Rankings of graphs
Siam J. Discrete Math.
(1998) - et al.
Minimal rankings
Networks
(1996)
There are more references available in the full text version of this article.
Cited by (1)
l<inf>p</inf> -Optimal Rankings and Max-Optimal Rankings are Different
2017, Graphs and Combinatorics
- 1
Affiliated Professor, University of Haifa.
Copyright © 2011 Elsevier B.V. All rights reserved.