On k-geodetic digraphs with excess one

On k-geodetic digraphs with excess one

<pre>A <span>k</span>-geodetic digraph <span>G</span> is a digraph in which, for every pair of vertices <span>u</span> and <span>v</span> (not necessarily distinct), there is at most one walk of length at most <span>k</span> from <...

Full description

Bibliographic Details
Main Author: Anita Abildgaard Sillasen
Format: Article
Language:English
Published: Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 2014-10-01
Series:Electronic Journal of Graph Theory and Applications
Subjects:
k-geodetic digraph, moore digraph, the degree/diameter problem, almost moore digraph
Online Access:https://www.ejgta.org/index.php/ejgta/article/view/57

Internet

https://www.ejgta.org/index.php/ejgta/article/view/57

Similar Items