About adjoint and -adjoint digraphs of -regular multigraphs. (Sobre digrafos adjuntos y  adjuntos de multidigrafos -regulares.)

Osio, Elsa; Braicovich, Teresa; Bernardi, Cora; Costes, Cristina

Displaying similar documents to “About adjoint and $(h, j)$ -adjoint digraphs of $k$ -regular multigraphs. (Sobre digrafos adjuntos y $(h, j)$ adjuntos de multidigrafos $k$ -regulares.)”

On a theorem of Fröberg and saturated graphs.

Estrada, Mario E. (2000)

Revista Colombiana de Matemáticas

Similarity:

Problems on stars in complete graphs.

Cammaroto, Agatina, Cordero, Luisa, Duran, Mirelli, González, Samuel (2000)

Divulgaciones Matemáticas

Similarity:

On reducing bandwidth of matrices in the Go-Away algorithm for regular grids.

Almeida Benítez, Pedro Ramón, Franco Brañas, José Ramón (1999)

Divulgaciones Matemáticas

Similarity:

Circulant matrices.

Lara, Teodoro (2001)

Divulgaciones Matemáticas

Similarity:

Algunos grafos compuestos.

Miguel Angel Fiol Mora, Josep Fàbrega Canudas (1983)

Stochastica

Similarity:

From two graphs G₁ and G₂ on N₁ and N₂ vertices respectively, the compound graph G₁[G₂] on N₁N₂ vertices is obtained by connecting in some way N₂ copies of G₁. We present in this paper methods of compounding that result in families of graphs with large number of vertices for...