Báo cáo toán học: "Colouring the petals of a graph" pot

... conclude that any petal graph G, other than P ∗ , must be Class 1. the electronic journal of combinatorics 10 (2003), #R6 6 Colouring the petals of a graph David Cariolaro ∗ Department of Mathematics University ... Mathematics University of Reading RG6 6AX U.K. davidcariolaro@hotmail.com Gianfranco Cariolaro Dipartimento di Ingegneria dell’ Informazione Universit`adiPadova 351...

Ngày tải lên : 07/08/2014, 07:21

11
399
0

Báo cáo toán học: "On the existence of hyperinvariant subspaces " pot

...

Ngày tải lên : 05/08/2014, 15:20

38
314
0

Báo cáo toán học: "On the Proof of a Theorem of P´lfy a" doc

... journal of combinatorics 13 (2006), #N16 2 On the Proof of a Theorem of Pálfy Edward Dobson Department of Mathematics and Statistics Mississippi State University PO Drawer MA Mississippi State, ... = 1, then y is conjugate to x in x, y. Proof. As x and y are abelian, and a transitive abelian subgroup is regular [3, Theorem 4. 2A (v)], we have that fix x (B) and fix ...

Ngày tải lên : 07/08/2014, 13:21

4
305
0

Báo cáo toán học: "Coloring the edges of a random graph without a monochromatic giant component" doc

... research in random graph theory is the component structure of the random graph G n,m (a graph drawn uniformly at random from all graphs ∗ A preliminary version of this paper appeared in the proceedings ... into an initially empty graph. Then the theorem states that a. a.s. a linear-sized ‘giant component’ emerges quite precisely at the point where the average degree in...

Ngày tải lên : 08/08/2014, 12:22

7
226
0

Báo cáo toán học: "Hyperbolicity and chordality of a graph" ppsx

... triple (AT ) of a graph G is a a set of three vertices of G such that for any pair of them there is a path connecting the two vertices and having a distance at least two to the remaining vertex. A ... 2-chordal graphs. A 3-chordal graph is usually termed as a chordal graph a nd a 4-chordal graph is often called a hole-free graph. The class of k-chordal grap...

Ngày tải lên : 08/08/2014, 12:23

22
331
0

Báo cáo toán học: " On the boundedness of the solutions in nonlinear discrete Volterra difference equations" pot

... nonlinear discrete Volterra difference equations István Gy˝ori ∗1 and Essam Awwad 1,2 1 Department of Mathematics, Faculty of Information Technology, University of Pannonia, Hungary 2 Department of ... interests The authors declare that they have no competing interests. Authors’ contributions This was a joint work in every aspect. All the authors have read and approved the fina...

Ngày tải lên : 20/06/2014, 20:20