An optimal k-ranking characterization of oriented paths and cycles

MaRDI QIDQ2999994zbMATH OpenFDO

Authors Rigoberto Flórenz, Darren Narayan

Publication date 18 May 2011

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38)

Recommendations

• Maximum minimal rankings of oriented trees
• Extrema property of the \(k\)-ranking of directed paths and cycles
• Rank numbers of graphs that are combinations of paths and cycles
• Rankings of Directed Graphs
• A characterization of optimal k-rankings of paths and cycles

Cited in

(9)

• Maximum minimal rankings of oriented trees
• Greedy algorithms for generalized k-rankings of paths
• Minimal rankings and the arank number of a path
• Further results on minimal rankings
• Extrema property of the \(k\)-ranking of directed paths and cycles
• scientific article; zbMATH DE number 1262792 (Why is no real title available?)
• Rankings of Directed Graphs
• A characterization of optimal k-rankings of paths and cycles
• A lower bound for on-line ranking number of a path

This page was built for publication: An optimal \(k\)-ranking characterization of oriented paths and cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999994)