Equivalence classes of eccentric digraphs

View/ Open
Issue date
2017Suggested 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.
Metadata
Show full item recordAbstract
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.
Is part of
Australasian journal of combinatorics, 2017, vol. 69, núm. 3, p. 410–416European research projects
Collections
Related items
Showing items related by title, author, creator and subject.
-
Triangle randomization for social network data anonymization
Brankovic, Ljiljana; López Lorenzo, Ignacio; Miller, Mirka; Sebé Feixas, Francesc (Society of Mathematicians, Physicists and Astronomers of SloveniaInstitute of Mathematics, Physics, and MechanicsUniversity of Primorska (Slovenia), 2014-06-27)In order to protect privacy of social network participants, network graph data should be anonymised prior to its release. Most proposals in the literature aim to achieve $k$-anonymity under specific assumptions about the ... -
Properties of mixed Moore graphs of directed degree one
López Lorenzo, Ignacio; Pujolàs Boix, Jordi (Elsevier, 2015-04-01)Mixed graphs of order n such that for any pair of vertices there is a unique trail of length at most k between them are known as mixed Moore graphs. These extremal graphs may only exist for diameter k = 2 and certain ... -
The unique mixed almost moore graph with parameters k = 2, r = 2 and z = 1
Buset, Dominique; López Lorenzo, Ignacio; Miret, Josep M. (Josep Maria) (World Scientific Publishing, 2017-11-02)A natural upper bound for the maximum number of vertices in a mixed graph with maximum undirected degree r, maximum directed out-degree z and diameter k is given by the mixed Moore bound. Graphs with order attaining the ...