Exploració per autor "Fiol Mora, Miquel Àngel"
Ara es mostren els items 68-87 de 139
-
José Gómez Martí: in memoriam 1958-2014
(Societat Catalana de Matemàtiques (SCM), 2015-12)
Altres
Accés obertLa vida és el que ens passa mentre fem altres plans (John Lennon) -
Line digraph iterations and the (d,k) digraph problem
(1984-05)
Article
Accés restringit per política de l'editorialThis paper studies the behavior of the diameter and the average distance between vertices of the line digraph of a given digraph. The results obtained are then applied to the so-called (d, k) digraph problem, that is, ... -
Load-balanced wavelength assignment strategies for optical burst/packet switching networks
(2009-03)
Article
Accés restringit per política de l'editorialLoss-free schemes are defined to ensure successful packet/burst transmissions in optical packet/burst switching networks. To this end, they rely on a collision-free routing and wavelength assignment (CF-RWA) scheme ... -
Measures of edge-uncolorability of cubic graphs
(2018-12-21)
Article
Accés obertThere are many hard conjectures in graph theory, like Tutte’s 5-flow conjecture, and the 5-cycle double cover conjecture, which would be true in general if they would be true for cubic graphs. Since most of them are trivially ... -
Moments in graphs
(2013)
Article
Accés obertLet G be a connected graph with vertex set V and a weight function that assigns a nonnegative number to each of its vertices. Then, the -moment of G at vertex u is de ned to be M G(u) = P v2V (v) dist(u; v), where ... -
Moore mixed graphs from Cayley graphs
(2023-03-25)
Article
Accés obertA Moore (r, z, k)-mixed graph G has every vertex with undirected degree r, directed in- and outdegree z, diameter k, and number of vertices (or order) attaining the corresponding Moore bound M(r, z, k) for mixed graphs. ... -
Multipartite Moore digraphs
(2006-04)
Article
Accés obertWe derive some Moore-like bounds for multipartite digraphs, which extend those of bipartite digraphs, under the assumption that every vertex of a given partite set is adjacent to the same number $\delta$ of vertices in ... -
New Moore-like bounds and some optimal families of abelian Cayley mixed graphs
(2020-06)
Article
Accés obertMixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case where such graphs are Cayley graphs of Abelian groups. Such groups can be ... -
New results for the Mondrian art problem
(2021-04-15)
Article
Accés obertThe Mondrian problem consists of dissecting a square of side length into non-congruent rectangles with natural length sides such that the difference between the largest and the smallest areas of the rectangles partitioning ... -
Number of walks and degree powers in a graph
(2006-04)
Article
Accés obertThis letter deals with the relationship between the total number of k-walks in a graph, and the sum of the k-th powers of its vertex degrees. In particular, it is shown that the sum of all k-walks is upper bounded by the ... -
On Almost Distance-Regular Graphs
(2010-03-12)
Report de recerca
Accés obert -
On almost distance-regular graphs
(2010)
Article
Accés restringit per política de l'editorialDistance-regular graphs are a key concept in Algebraic Combinatorics and have given rise to several generalizations, such as association schemes. Motivated by spectral and other algebraic characterizations of distance-regular ... -
On bipartite-mixed graphs
(Wiley, 2018-04-24)
Article
Accés obertMixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case where such graphs are bipartite. As main results, we show that in this context ... -
On congruence in $Z^n$ and the dimension of a multidimensional circulant
(Elsevier, 1995)
Article
Accés obertFrom a generalization to $Z^n$ of the concept of congruence we define a family of regular digraphs or graphs called multidimensional circulants, which turn to be Cayley (di)graphs of Abelian groups. This paper is mainly ... -
On d-Fibonacci digraphs
(2021-10-03)
Article
Accés obertThe d-Fibonacci digraphs F(d, k), introduced here, have the number of vertices following some generalized Fibonacci-like sequences. They can be defined both as digraphs on alphabets and as iterated line digraphs. Here we ... -
On inertia and ratio type bounds for the k-independence number of a graph and their relationship
(Elsevier, 2023-07-15)
Article
Accés obertFor , the -independence number of a graph is the maximum number of vertices that are mutually at distance greater than . The well-known inertia and ratio bounds for the (1-)independence number of a graph, due to Cvetković ... -
On k-Walk-Regular Graphs
(2008-08)
Article
Accés obertConsidering a connected graph $G$ with diameter $D$, we say that it is \emph{$k$-walk-regular}, for a given integer $k$ $(0\leq k \leq D)$, if the number of walks of length $\ell$ between vertices $u$ and $v$ only depends ... -
On middle cube graphs
(2015)
Article
Accés obertWe study a family of graphs related to the $n$-cube. The middle cube graph of parameter k is the subgraph of $Q_{2k-1}$ induced by the set of vertices whose binary representation has either $k-1$ or $k$ number of ones. The ... -
On outindependent subgraphs of strongly regular graphs
(Taylor & Francis, 2006)
Article
Accés obertAn outindependent subgraph of a graph G, with respect to an independent vertex subset C¿¿V, is the subgraph GC induced by the vertices in V\¿C. We study the case when G is strongly regular, where the results of de Caen ... -
On quotient digraphs and voltage digraphs
(2016)
Report de recerca
Accés obertIn this note we present a general approach to construct large digraphs from small ones. These are called expanded digraphs, and, as particular cases, we show their close relationship between voltage digraphs and line ...
