The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 801 –
820 of
8549
A graph G on n vertices is said to be pancyclic if it contains cycles of all lengths k for k ∈ {3, . . . , n}. A vertex v ∈ V (G) is called super-heavy if the number of its neighbours in G is at least (n+1)/2. For a given graph H we say that G is H-f1-heavy if for every induced subgraph K of G isomorphic to H and every two vertices u, v ∈ V (K), dK(u, v) = 2 implies that at least one of them is super-heavy. For a family of graphs H we say that G is H-f1-heavy, if G is H-f1-heavy for every graph...
A latin trade is a subset of a latin square which may be replaced with a disjoint mate to obtain a new latin square. A -homogeneous latin trade is one which intersects each row, each column and each entry of the latin square either or times. In this paper, we show that a construction given by Cavenagh, Donovan and Drápal for -homogeneous latin trades in fact classifies every minimal -homogeneous latin trade. We in turn classify all -homogeneous latin trades. A corollary is that any -homogeneous...
Recently Prodinger [8] considered the reciprocal super Catalan matrix and gave explicit formulæ for its LU-decomposition, the LU-decomposition of its inverse, and obtained some related matrices. For all results, q-analogues were also presented. In this paper, we define and study a variant of the reciprocal super Catalan matrix with two additional parameters. Explicit formulæ for its LU-decomposition, LUdecomposition of its inverse and the Cholesky decomposition are obtained. For all results, q-analogues...
Currently displaying 801 –
820 of
8549