Cristina Dalfó

Orcid: 0000-0002-8438-9353

Affiliations:
  • Polytechnic University of Catalonia, Barcelona, Spain


According to our database1, Cristina Dalfó authored at least 48 papers between 2004 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
On inertia and ratio type bounds for the k-independence number of a graph and their relationship.
Discret. Appl. Math., July, 2023

Moore mixed graphs from Cayley graphs.
Electron. J. Graph Theory Appl., 2023

On the Spectra and Spectral Radii of Token Graphs.
Proceedings of the 23rd Conference Information Technologies, 2023

2021
On d-Fibonacci digraphs.
Electron. J. Graph Theory Appl., 2021

Sufficient conditions for a digraph to admit a <i>(1, \le l)</i>-identifying code.
Discuss. Math. Graph Theory, 2021

Decompositions of a rectangle into non-congruent rectangles of equal area.
Discret. Math., 2021

Bipartite biregular Moore graphs.
Discret. Math., 2021

New results for the Mondrian art problem.
Discret. Appl. Math., 2021

New cyclic Kautz digraphs with optimal diameter.
Contributions Discret. Math., 2021

2020
An improved Moore bound and some new optimal families of mixed Abelian Cayley graphs.
Discret. Math., 2020

Identifying codes in line digraphs.
Appl. Math. Comput., 2020

2019
A Note on a New General Family of Deterministic Hierarchical Networks.
J. Interconnect. Networks, 2019

On the Randić index of graphs.
Discret. Math., 2019

An algebraic approach to lifts of digraphs.
Discret. Appl. Math., 2019

A new approach to gross error detection for GPS networks.
Discret. Appl. Math., 2019

A new general family of mixed graphs.
Discret. Appl. Math., 2019

El mètode de les línies per a la resolució numèrica d'equacions en derivades parcials. The method of lines for numerical solutions of partial differential equations.
CoRR, 2019

2018
From Subkautz Digraphs to Cyclic Kautz Digraphs.
J. Interconnect. Networks, 2018

On bipartite-mixed graphs.
J. Graph Theory, 2018

Graphs, friends and acquaintances.
Electron. J. Graph Theory Appl., 2018

An improved upper bound for the order of mixed graphs.
Discret. Math., 2018

2017
A Note on the Order of Iterated Line Digraphs.
J. Graph Theory, 2017

Sequence mixed graphs.
Discret. Appl. Math., 2017

2015
The Diameter of Cyclic Kautz Digraphs.
Electron. Notes Discret. Math., 2015

On middle cube graphs.
Electron. J. Graph Theory Appl., 2015

Deterministic hierarchical networks.
CoRR, 2015

2014
The degree/diameter problem in maximal planar bipartite graphs.
Electron. Notes Discret. Math., 2014

The (Delta, D) and (Delta, N) problems in double-step digraphs with unilateral distance.
Electron. J. Graph Theory Appl., 2014

Corrigendum to "Algebraic characterizations of regularity properties in bipartite graphs" [European J. Combin. 34 (2013) 1223-1231].
Eur. J. Comb., 2014

2013
Edge-distance-regular graphs are distance-regular.
J. Comb. Theory, Ser. A, 2013

The Manhattan product of digraphs.
Electron. J. Graph Theory Appl., 2013

Algebraic characterizations of regularity properties in bipartite graphs.
Eur. J. Comb., 2013

Moments in graphs.
Discret. Appl. Math., 2013

2012
Dual concepts of almost distance-regularity and the spectral excess theorem.
Discret. Math., 2012

The (Δ,D) and (Δ,N) problems for New Amsterdam and Manhattan digraphs
CoRR, 2012

2011
On almost distance-regular graphs.
J. Comb. Theory, Ser. A, 2011

Edge-distance-regular graphs.
Electron. Notes Discret. Math., 2011

A Differential Approach for Bounding the Index of Graphs under Perturbations.
Electron. J. Comb., 2011

2010
The geometry of <i>t</i>-spreads in <i>k</i>-walk-regular graphs.
J. Graph Theory, 2010

2009
On t-Cliques in k-Walk-Regular Graphs.
Electron. Notes Discret. Math., 2009

The generalized hierarchical product of graphs.
Discret. Math., 2009

The hierarchical product of graphs.
Discret. Appl. Math., 2009

On k-Walk-Regular Graphs.
Electron. J. Comb., 2009

2008
Multidimensional Manhattan Street Networks.
SIAM J. Discret. Math., 2008

2007
The Multidimensional Manhattan Network.
Electron. Notes Discret. Math., 2007

A Spectral Study of the Manhattan Networks.
Electron. Notes Discret. Math., 2007

2005
Optimal Broadcasting in 2-Dimensional Manhattan Street Networks.
Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks, 2005

2004
Using Genetic Programming to Design Broadcasting Algorithms for Manhattan Street Networks.
Proceedings of the Applications of Evolutionary Computing, 2004


  Loading...