Browsing by Author "Dalfó Simó, Cristina"
Now showing items 120 of 90

A differential approach for bounding the index of graphs under perturbations
Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest (20110902)
Article
Open AccessThis paper presents bounds for the variation of the spectral radius (G) of a graph G after some perturbations or local vertex/edge modifications of G. The perturbations considered here are the connection of a new vertex ... 
A differential approach for bounding the index of graphs under perturbations
Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest (201103)
Research report
Open Access 
A general method to obtain the spectrum and local spectra of a graph from its regular partitions
Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel (20200712)
Article
Open AccessIt is well known that, in general, part of the spectrum of a graph can be obtained from the adjacency matrix of its quotient graph given by a regular partition. In this paper, a method that gives all the spectrum, and also ... 
A new approach to gross error detection for GPS networks
Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel (20190529)
Article
Open AccessWe present a new matrixbased approach to detect and correct gross errors in GPS geodetic control networks. The study is carried out by introducing a new matrix, whose entries are powers of a (real or complex) variable, ... 
A new general family of mixed graphs
Dalfó Simó, Cristina (20190111)
Article
Open AccessA new general family of mixed graphs is presented, which generalizes both the pancake graphs and the cycle prefix digraphs. The obtained graphs are vertex transitive and, for some values of the parameters, they constitute ... 
A note on a new general family of deterministic hierarchical networks
Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel (20190601)
Article
Open AccessHierarchical network; Smallword; Scalefree; Routing algorithm; Diameter; Clustering 
A note on the order of iterated line digraphs
Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel (Wiley, 20160727)
Article
Open AccessGiven a digraph G, we propose a new method to find the recurrence equation for the number of vertices n_k of the kiterated line digraph L_k(G), for k>= 0, where L_0(G) = G. We obtain this result by using the minimal polynomial ... 
A survey on the missing Moore graph
Dalfó Simó, Cristina (Elsevier, 2019)
Article
Open AccessThis is a survey on some known properties of the possible Moore graph (or graphs) ¿ with degree 57 and diameter 2. Moreover, we give some new results about it, such as the following. When we consider the distance partition ... 
Algebraic Characterizations of Regularity Properties in Bipartite Graphs
Abiad Monge, Aida; Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel (2013)
Article
Restricted access  publisher's policyRegular and distanceregular characterizations of general graphs are wellknown. In particular, the spectral excess theorem states that a connected graph GG is distanceregular if and only if its spectral excess (a number ... 
An algebraic approach to lifts of digraphs
Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel; Miller, Mirka; Ryan, Joe; Siran, Josef (201909)
Article
Open AccessWe study the relationship between two key concepts in the theory of (di)graphs: the quotient digraph, and the lift Ga of a base (voltage) digraph. These techniques contract or expand a given digraph in order to study its ... 
An improved Moore bound and some new optimal families of mixed Abelian Cayley graphs
Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel; López Lorenzo, Nacho; Ryan, Joe (202010)
Article
Open AccessWe consider the case in which mixed graphs (with both directed and undirected edges) are Cayley graphs of Abelian groups. In this case, some Moore bounds were derived for the maximum number of vertices that such graphs can ... 
An improved upper bound for the order of mixed graphs
Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel; López Lorenzo, Nacho (201807)
Article
Open AccessA mixed graph G can contain both (undirected) edges and arcs (directed edges). Here we derive an improved Moorelike bound for the maximum number of vertices of a mixed graph with diameter at least three. Moreover, a ... 
Bipartite biregular Moore graphs
Araujo Pardo, Gabriela; Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel; López Lorenzo, Nacho (202111)
Article
Open AccessA bipartite graph G = (V, E) with V = V1 ¿ V2 is biregular if all the vertices of a stable set Vi have the same degree ri for i = 1, 2. In this paper, we give an improved new Moore bound for an infinite family of such ... 
Characterizing (l,m)walkregularity
Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest (200905)
Article
Open AccessA graph $\G$ with diameter $D$ and $d+1$ distinct eigenvalues is said to be {\it $(\ell,m)$walkregular}, for some integers $\ell\in[0,d]$ and $m\in[0,D]$, $\ell\ge m$, if the number of walks of length $i\in [0,\ell]$ ... 
Characterizing identifying codes from the spectrum of a graph or digraph
Balbuena Martínez, Maria Camino Teófila; Dalfó Simó, Cristina; Martínez Barona, Berenice (Elsevier, 20190601)
Article
Open AccessA identifying code in digraph D is a dominating subset C of vertices of D, such that all distinct subsets of vertices of D with cardinality at most l have distinct closed inneighborhoods within C. As far as we know, it ... 
Characterizing identifying codes through the spectrum of a graph or digraph
Balbuena Martínez, Maria Camino Teófila; Dalfó Simó, Cristina; Martínez Barona, Berenice (2017)
Conference report
Open Access 
Corrigendum to "Algebraic characterizations of regularity properties in bipartite graphs" Eur. J. Combin. 34 (2013) 12231231
Abiad Monge, Aida; Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel (2014)
Article
Open Access 
Cospectral digraphs from locally line digraphs
Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel (Elsevier, 20160701)
Article
Open AccessA digraph Gamma = (V, E) is a line digraph when every pair of vertices u, v is an element of V have either equal or disjoint in neighborhoods. When this condition only applies for vertices in a given subset (with at least ... 
Decompositions of a rectangle into noncongruent rectangles of equal area
Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel; López Lorenzo, Nacho; Martínez Pérez, Álvaro (202106)
Article
Open AccessIn this paper, we deal with a simple geometric problem: Is it possible to partition a rectangle into k noncongruent rectangles of equal area? This problem is motivated by the socalled ‘Mondrian art problem’ that asks a ... 
Deterministic hierarchical networks
Barrière Figueroa, Eulalia; Comellas Padró, Francesc de Paula; Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel (2016)
Article
Open AccessIt has been shown that many networks associated with complex systems are smallworld (they have both a large local clustering coefficient and a small diameter) and also scalefree (the degrees are distributed according ...