#### Filter Results:

- Full text PDF available (11)

#### Publication Year

1991

2016

- This year (0)
- Last 5 years (4)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Josep M. Brunat, Antonio Montes
- SIAM J. Matrix Analysis Applications
- 2001

Community detection has arisen as one of the most relevant topics in the field of graph data mining due to its importance in many fields such as biology, social networks or network traffic analysis. The metrics proposed to shape communities are too lax and do not consider the internal layout of the edges in the community, which lead to undesirable results.… (More)

Community detection has arisen as one of the most relevant topics in the field of graph data mining due to its applications in many fields such as biology, social networks, or network traffic analysis. Although the existing metrics used to quantify the quality of a community work well in general, under some circumstances, they fail at correctly capturing… (More)

- Josep M. Brunat, Margarida Espona, Miguel Angel Fiol, Oriol Serra
- Eur. J. Comb.
- 1999

The complete generalized cycle G(d, n) is the digraph which has Zn × Zd as the vertex set and every vertex (i, x) is adjacent to the d vertices (i + 1, y) with y ∈ Zd . As a main result, we give a necessary and sufficient condition for the iterated line digraph G(d, n, k) = Lk−1G(d, n), with d a prime number, to be a Cayley digraph in terms of the existence… (More)

- Josep M. Brunat, Antonio Montes
- ISSAC
- 2004

Let Φ(<i>x,y</i>)∈ ℂ[<i>x,y</i>] be a symmetric polynomial of partial degree <i>d</i>. The graph <i>G</i>(Φ) is defined by taking ℂ as set of vertices and the points of 𝕍 (Φ(<i>x,y</i>)) as edges. We study the following problem: given a finite, connected, <i>d</i>-regular graph <i>H</i>, find the polynomials… (More)

- Josep M. Brunat, Montserrat Maureso, Mercè Mora
- Discrete Mathematics
- 1999

- Josep M. Brunat, Margarida Espona, Miguel Angel Fiol, Oriol Serra
- Discrete Mathematics
- 1995

- JOSEP M. BRUNAT
- 1999

Given a symmetric polynomial 8(x, y) over a perfect field k of characteristic zero, the Galois graph G(8) is defined by taking the algebraic closure k̄ as the vertex set and adjacencies corresponding to the zeroes of 8(x, y). Some graph properties of G(8), such as lengths of walks, distances and cycles are described in terms of 8. Symmetry is also… (More)

- Josep M. Brunat, Antonio Montes
- Mathematics in Computer Science
- 2016

- J. M. Brunat, C. Krattenthaler, Bernard Lyon-I
- 2005

We compute two parametric determinants in which rows and columns are indexed by compositions, where in one determinant the entries are products of binomial coefficients, while in the other the entries are products of powers. These results generalize previous determinant evaluations due to the first and third author [SIAM J. Matrix Anal. Appl. 23 (2001),… (More)