Norms, spectra and combinatorial properties of matrices
For a simple graph on vertices and an integer with , denote by the sum of largest signless Laplacian eigenvalues of . It was conjectured that , where is the number of edges of . This conjecture has been proved to be true for all graphs when , and for trees, unicyclic graphs, bicyclic graphs and regular graphs (for all ). In this note, this conjecture is proved to be true for all graphs when , and for some new classes of graphs.
The purpose of this paper is to present a modern approach to the analysis of variance (ANOVA) of disconnected resolvable group divisible partially balanced incomplete block (GDPBIB) designs with factorial structure and with some interaction effects completely confounded. A characterization of a factorial experiment with completely confounded interaction is given. The treatment effect estimators and some relations between the matrix F of the reduced normal equations and the information matrix A are...
Complementing the work of Baksalary and Trenkler [2], we announce some results characterizing the core matrix partial ordering.
We prove that on , there is no n-supercyclic operator with 1 ≤ n < ⌊(N + 1)/2⌋, i.e. if has an n-dimensional subspace whose orbit under is dense in , then n is greater than ⌊(N + 1)/2⌋. Moreover, this value is optimal. We then consider the case of strongly n-supercyclic operators. An operator is strongly n-supercyclic if has an n-dimensional subspace whose orbit under T is dense in , the nth Grassmannian. We prove that strong n-supercyclicity does not occur non-trivially in finite...