Some composite graphs.

Miguel Angel Fiol Mora; Josep Fàbrega Canudas

Stochastica (1983)

  • Volume: 7, Issue: 2, page 137-143
  • ISSN: 0210-7821

Abstract

top
From two graphs G1 and G2 on N1 and N2 vertices respectively, the compound graph G1[G2] on N1N2 vertices is obtained by connecting in some way N2 copies of G1.We present in this paper methods of compounding that result in families of graphs with large number of vertices for given values of the maximum degree ∆ and diameter D.

How to cite

top

Fiol Mora, Miguel Angel, and Fàbrega Canudas, Josep. "Algunos grafos compuestos.." Stochastica 7.2 (1983): 137-143. <http://eudml.org/doc/38891>.

@article{FiolMora1983,
author = {Fiol Mora, Miguel Angel, Fàbrega Canudas, Josep},
journal = {Stochastica},
keywords = {Grafos compuestos; Grafos bipartitos; Distancia entre vértices; graph composition; compound graph},
language = {spa},
number = {2},
pages = {137-143},
title = {Algunos grafos compuestos.},
url = {http://eudml.org/doc/38891},
volume = {7},
year = {1983},
}

TY - JOUR
AU - Fiol Mora, Miguel Angel
AU - Fàbrega Canudas, Josep
TI - Algunos grafos compuestos.
JO - Stochastica
PY - 1983
VL - 7
IS - 2
SP - 137
EP - 143
LA - spa
KW - Grafos compuestos; Grafos bipartitos; Distancia entre vértices; graph composition; compound graph
UR - http://eudml.org/doc/38891
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.