\(l_p\)-optimal rankings and max-optimal rankings are different

DOI10.1007/s00373-017-1824-1zbMath1380.05174OpenAlexW2716271907MaRDI QIDQ1696534

Jobby Jacob, Bonnie C. Jacob

Publication date: 14 February 2018

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-017-1824-1

zbMATH Keywords

vertex ranking\(l_p\) norm\(l_p\)-optimal rankingmax-optimal ranking

Mathematics Subject Classification ID

Convergence and divergence of series and sequences (40A05) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items

Graphs with large rank numbers and rank numbers of subdivided stars

Cites Work

• Unnamed Item
• Rank numbers of grid graphs
• Rank numbers for some trees and unicyclic graphs
• Max-optimal and sum-optimal labelings of graphs
• Ranking numbers of graphs
• On an edge ranking problem of trees and graphs
• Minimal \(k\)-rankings and the rank number of \(P^2_n\)
• On a graph partition problem with application to VLSI layout
• Optimal edge ranking of trees in polynomial time
• The Role of Elimination Trees in Sparse Factorization
• The Multifrontal Solution of Indefinite Sparse Symmetric Linear
• On-line ranking number for cycles and paths
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Minimal rankings