dc.contributor.author |
López Lorenzo, Ignacio |
dc.date |
2018-01-09T11:56:20Z |
dc.date |
2018-01-09T11:56:20Z |
dc.date |
2017 |
dc.identifier |
1034-4942 |
dc.identifier |
http://hdl.handle.net/10459.1/62315 |
dc.identifier.uri |
http://hdl.handle.net/10459.1/62315 |
dc.description |
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. |
dc.language |
eng |
dc.publisher |
Centre for Discrete Mathematics and Computing |
dc.relation |
Reproducció del document publicat a https://ajc.maths.uq.edu.au/pdf/69/ajc_v69_p410.pdf |
dc.relation |
Australasian journal of combinatorics, 2017, vol. 69, núm. 3, p. 410–416 |
dc.rights |
(c) Centre for Discrete Mathematics and Computing, 2017 |
dc.rights |
info:eu-repo/semantics/openAccess |
dc.title |
Equivalence classes of eccentric digraphs |
dc.type |
article |
dc.type |
publishedVersion |