Exploració per autor "Dalfó Simó, Cristina"
Ara es mostren els items 66-85 de 92
-
Sequence mixed graphs
Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel; López, Nacho (2016-12)
Article
Accés obertA mixed graph can be seen as a type of digraph containing some edges (or two opposite arcs). Here we introduce the concept of sequence mixed graphs, which is a generalization of both sequence graphs and literated line ... -
Some results on the laplacian spectra of Token graphs
Dalfó Simó, Cristina; Duque, Frank; Fabila Monroy, Ruy; Fiol Mora, Miquel Àngel; Huemer, Clemens; Trujillo Negrete, Ana Laura; Zaragoza Martínez, Francisco (Springer, 2021)
Text en actes de congrés
Accés obertWe study the Laplacian spectrum of token graphs, also called symmetric powers of graphs. The k-token graph Fk(G) of a graph G is the graph whose vertices are the k-subsets of vertices from G, two of which being adjacent ... -
Spectra and eigenspaces from regular partitions of Cayley (di)graphs of permutation groups
Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel (Elsevier, 2020-07-15)
Article
Accés obertIn this paper, we present a method to obtain regular (or equitable) partitions of Cayley (di)graphs (that is, graphs, digraphs, or mixed graphs) of permutation groups on n letters. We prove that every partition of the ... -
Spectra and eigenspaces of arbitrary lifts of graphs
Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel; Pavlíková, Sona; Siran, Josef (2019)
Article
Accés obertWe describe, in a very explicit way, a method for determining the spectra and bases of all the corresponding eigenspaces of arbitrary lifts of graphs (regular or not) -
Spectra and eigenspaces of arbitrary lifts of graphs
Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel; Pavlíková, Sona; Siran, Josef (2021-09)
Article
Accés obertWe describe, in a very explicit way, a method for determining the spectra and bases of all the corresponding eigenspaces of arbitrary lifts of graphs (regular or not). -
Sufficient conditions for a digraph to admit a (1,=l)-identifying code
Balbuena Martínez, Maria Camino Teófila; Dalfó Simó, Cristina; Martínez Barona, Berenice (2019)
Article
Accés obertA (1, = `)-identifying code in a digraph D is a subset C of vertices of D such that all distinct subsets of vertices of cardinality at most ` have distinct closed in-neighbourhoods within C. In this paper, we give some ... -
The (Delta,D) and (Delta,N) problems in double-step digraphs with unilateral diameter
Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel (2013)
Comunicació de congrés
Accés obertWe study the (D;D) and (D;N) problems for double-step digraphs considering the unilateral distance, which is the minimum between the distance in the digraph and the distance in its converse digraph, obtained by changing ... -
The (Delta,D) and (Delta,N) problems in double-step digraphs with unilateral distance
Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel (2014)
Article
Accés restringit per política de l'editorialWe study the (delta;D) and (delta;N) problems for double-step digraphs considering the unilateral distance, which is the minimum between the distance in the digraph and the distance in its converse digraph, the latter ... -
The degree-diameter problem in maximal bipartite planar graphs
Dalfó Simó, Cristina; Huemer, Clemens; Salas, Julian (2014)
Comunicació de congrés
Accés obertThe (A ,D) (degree/diameter) problem consists of finding the largest possible number of vertices n among all the graphs with maximum degree and diameter D. We consider the (A ,D) problem for maximal planar bipartite ... -
The degree/diameter problem in maximal planar bipartite graphs
Dalfó Simó, Cristina; Huemer, Clemens; Salas Piñon, Julián (2014)
Article
Accés obertThe (¿;D) (degree/diameter) problem consists of nding the largest possible number of vertices n among all the graphs with maximum degree ¿ and diameter D. We consider the (¿;D) problem for maximal planar bipartite graphs, ... -
The degree/diameter problem in maximal planar bipartite graphs
Dalfó Simó, Cristina; Huemer, Clemens; Salas Piñon, Julián (2016)
Article
Accés obertThe (Δ,D)(Δ,D) (degree/diameter) problem consists of finding the largest possible number of vertices nn among all the graphs with maximum degree ΔΔ and diameter DD. We consider the (Δ,D)(Δ,D) problem for maximal planar ... -
The diameter of cyclic Kautz digraphs
Böhmová, Katerina; Dalfó Simó, Cristina; Huemer, Clemens (2017)
Article
Accés obertWe present a new kind of digraphs, called cyclic Kautz digraphs CK(d, `), which are subdigraphs of the well-known Kautz digraphs K(d, `). The latter have the smallest diameter among all digraphs with their number of vertices ... -
The diameter of cyclic Kautz digraphs
Böhmová, Katerina; Dalfó Simó, Cristina; Huemer, Clemens (2015-11-12)
Article
Accés obertA prominent problem in Graph Theory is to find extremal graphs or digraphs with restrictions in their diameter, degree and number of vertices. Here we obtain a new family of digraphs with minimal diameter, that is, given ... -
The generalized hierarchical product of graphs
Barrière Figueroa, Eulalia; Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel; Mitjana Riera, Margarida (2008-01)
Article
Accés obertA generalization of both the hierarchical product and the Cartesian product of graphs is introduced and some of its properties are studied. We call it the generalized hierarchical product. In fact, the obtained graphs ... -
The geometry of t-cliques in k-walk-regular graphs
Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest (2008-09)
Article
Accés obertA graph is walk-regular if the number of cycles of length $\ell$ rooted at a given vertex is a constant through all the vertices. For a walk-regular graph $G$ with $d+1$ different eigenvalues and spectrally maximum ... -
The geometry of t-spreads in k-walk-regular graphs
Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest (Wiley InterScience, 2010-08)
Article
Accés obertA graph is walk-regular if the number of closed walks of length rooted at a given vertex is a constant through all the vertices for all . For a walk-regular graph G with d+1 different eigenvalues and spectrally maximum ... -
The hierarchical product of graphs
Barrière Figueroa, Eulalia; Comellas Padró, Francesc de Paula; Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel (2007)
Article
Accés obertA new operation on graphs is introduced and some of its properties are studied. We call it hierarchical product, because of the strong (connectedness) hierarchy of the vertices in the resulting graphs. In fact, the ... -
The Manhattan product of digraphs
Comellas Padró, Francesc de Paula; Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel (2007-10-03)
Article
Accés obertWe give a formal definition of a new product of bipartite digraphs, the Manhattan product, and we study some of its main properties. It is shown that when all the factors of the above product are (directed) cycles, then ... -
The Manhattan product of digraphs
Comellas Padró, Francesc de Paula; Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel (2013)
Article
Accés obertWe study the main properties of a new product of bipartite digraphs which we call Manhattan product. This product allows us to understand the subjacent product in the Manhattan street networks and can be used to built other ... -
The multidimensional Manhattan networks
Comellas Padró, Francesc de Paula; Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel (2007)
Article
Accés obertThe $n$-dimensional Manhattan network $M_n$---a special case of $n$-regular digraph---is formally defined and some of its structural properties are studied. In particular, it is shown that $M_n$ is a Cayley digraph, ...