Ranking numbers of graphs

DOI10.1016/J.IPL.2010.05.025MaRDI QIDQ765523zbMATH OpenOpenAlexFDO

Authors D. Kharzeev

Publication date 19 March 2012

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2010.05.025

zbMATH Keywords

powercompositioncycleindependent setranking numbervertex rankingCartesian productcombinatorial problemspathcaterpillarminimal cut set

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Rank numbers of graphs that are combinations of paths and cycles
• Rankings of Graphs
• scientific article; zbMATH DE number 1743759
• Rankings of Directed Graphs
• Minimal rankings

Cites work

• Edge ranking of graphs is hard
• Minimal rankings
• On the vertex ranking problem for trapezoid, circular-arc and other graphs
• Optimal node ranking of tree in linear time
• Optimal node ranking of trees
• Ordered colourings
• Rankings of Graphs

Cited in

(20)

• A characterization of optimal \(k\)-rankings of paths and cycles
• On vertex rankings of graphs and its relatives
• Graph 2-rankings
• Ranking the Vertices of a Paired Comparison Digraph
• \(l_p\)-optimal rankings and max-optimal rankings are different
• On the rank number of the Cartesian product \(K_m \square K_n\)
• Rank numbers for bent ladders
• Graph pegging numbers
• Rankings of graphs
• scientific article; zbMATH DE number 2076918 (Why is no real title available?)
• Lower against number in graphs
• Maximizing the number of edges in optimal \(k\)-rankings
• Uniqueness and minimal obstructions for tree-depth
• Rank numbers of grid graphs
• The birank number of operationally constructed graphs
• scientific article; zbMATH DE number 139918 (Why is no real title available?)
• List rankings and on-line list rankings of graphs
• On 1-uniqueness and dense critical graphs for tree-depth
• Rank numbers for some trees and unicyclic graphs
• Graphs whose \(l_p\)-optimal rankings are \(l_{\infty}\) optimal

This page was built for publication: Ranking numbers of graphs

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