EnglishFor a given graph G we say that a G-design is balanced if there exists a constant r such that for each point x the number of blocks containing x is equal to r. A G-design is degree-balanced if, for each degree d occurring in the graph G, there exists a constant r_d such that, for each point x, the number of blocks containing x as a vertex of degree d is equal to r_d.Let V_1, V_2, . . . , V_h be the vertex-orbits of G under its automorphism group. A G-design is said to be orbit-balanced (or strongly balanced) if for i = 1, 2, . . . , h there exists a constant R_i such that, for each point x the number of blocks of the G-design in which x occurs as an element in the orbit V_i is equal to R_i.If G is a tree with six vertices, we determine the values of v for which a balanced G-design with v points exists, the values of v for which a degree-balanced G-design with v points exists, and the values of v for which an orbit-balanced G-design with v points exists.We also consider the existence problem for G-designs which are not balanced, which are balanced but not degree-balanced, and which are degree-balanced but not orbit-balanced.
| Data di pubblicazione: | 2013 |
| Titolo: | Tree-designs with balanced-type conditions |
| Autore/i: | Bonisoli, Arrigo; Ruini, Beatrice |
| Autore/i UNIMORE: | |
| Digital Object Identifier (DOI): | 10.1016/j.disc.2011.12.020 |
| Rivista: | |
| Volume: | 313 |
| Pagina iniziale: | 1197 |
| Pagina finale: | 1205 |
| Codice identificativo ISI: | WOS:000317810100008 |
| Codice identificativo Scopus: | 2-s2.0-84887084792 |
| Citazione: | Tree-designs with balanced-type conditions / Bonisoli, Arrigo; Ruini, Beatrice. - In: DISCRETE MATHEMATICS. - ISSN 0012-365X. - STAMPA. - 313(2013), pp. 1197-1205. |
| Tipologia | Articolo su rivista |
File in questo prodotto:
http://hdl.handle.net/11380/704336
I documenti presenti in Iris Unimore sono rilasciati con licenza Creative Commons Attribuzione - Non commerciale - Non opere derivate 3.0 Italia, salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris
Copyright © 2019