On the fastest moving off from a vertex in directed regular graphs

DOI10.1134/S0001434607110119zbMATH Open1143.05039OpenAlexW2005911286MaRDI QIDQ941900FDOQ941900

Authors: V. I. Trofimov 

Publication date: 2 September 2008

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0001434607110119

Recommendations

• scientific article; zbMATH DE number 7678024
• A search problem on a graph under restriction of the velocity
• Exact and approximate algorithms for movement problems on (special classes of) graphs
• Exact and approximate algorithms for movement problems on (special classes of) graphs
• Shortest paths in distance-regular graphs
• Extremal problems for directed graphs
• Vertex-pursuit in random directed acyclic graphs
• On vertex-disjoint paths in regular graphs
• Optimally fast shortest path algorithms for some classes of graphs

zbMATH Keywords

automorphism groupdirected graphundirected graphlocally finite graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Paths and cycles (05C38)

Cites Work

• On geometric properties of directed vertex-symmetric graphs

Cited In (2)

• On geometric properties of directed vertex-symmetric graphs
• On the action of a group on a graph. II

This page was built for publication: On the fastest moving off from a vertex in directed regular graphs

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