Ranking measures for radially Moore graphs
From MaRDI portal
Recommendations
- The degree ratio ranking method for directed graphs
- Rank-determining sets of metric graphs
- On the rank spread of graphs
- Rankings of Directed Graphs
- On graphs associated to sets of rankings
- On vertex rankings of graphs and its relatives
- On the rank of weighted graphs
- scientific article; zbMATH DE number 1262792
- On the rank of the distance matrix of graphs
- The rank and size of graphs
Cites work
- A note on radially Moore digraphs
- HSAGA and its application for the construction of near-Moore digraphs
- scientific article; zbMATH DE number 4074878 (Why is no real title available?)
- scientific article; zbMATH DE number 1232919 (Why is no real title available?)
- scientific article; zbMATH DE number 194437 (Why is no real title available?)
- scientific article; zbMATH DE number 3432305 (Why is no real title available?)
- scientific article; zbMATH DE number 3412694 (Why is no real title available?)
- Moore graphs and beyond: a survey of the degree/diameter problem
- On Moore Graphs with Diameters 2 and 3
Cited in
(7)- On the existence of radial Moore graphs for every radius and every degree
- The degree ratio ranking method for directed graphs
- On new record graphs close to bipartite Moore graphs
- Radial Moore graphs of radius three
- A note on radially Moore digraphs
- On mixed radial Moore graphs of diameter 3
- Bounds in radial Moore graphs of diameter 3
This page was built for publication: Ranking measures for radially Moore graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3064042)
