Equivalence classes of eccentric digraphs

López Lorenzo, Ignacio

View/Open

026536.pdf (115.7Kb)

Issue date

2017

Author

López Lorenzo, Ignacio

Suggested citation

López Lorenzo, Ignacio; . (2017) . Equivalence classes of eccentric digraphs. Australasian journal of combinatorics, 2017, vol. 69, núm. 3, p. 410–416. http://hdl.handle.net/10459.1/62315.

Abstract

The eccentric digraph operator takes a graph G (either directed or undirected) as a basis and transforms it into a digraph ED(G) with the same vertices as G and where there is an arc from a vertex u to a vertex v if and only if v is a farthest vertex from u in G, that is, v is an eccentric vertex of u. The eccentric digraph ED(G) induces a partition of the set of all digraphs of given order. In this paper, we deal with some properties of the partition.

URI

http://hdl.handle.net/10459.1/62315

Is part of

Australasian journal of combinatorics, 2017, vol. 69, núm. 3, p. 410–416

Collections

Articles publicats (Matemàtica) [263]