论文信息 - A Cauchy-Khinchin matrix inequality

A Cauchy-Khinchin matrix inequality

Abstract We derive a matrix inequality, which generalizes the Cauchy-Schwarz inequality for vectors, and Khinchin's inequality for zero–one matrices. Furthermore, we pose a related problem on the maximum irregularity of a directed graph with prescribed number of vertices and arcs, and make some remarks on this problem.

Edwin R. van Dam | E. V. Dam

[1] A problem on $0-1$ matrices , 1989 .

[2] Dominique de Caen,et al. An upper bound on the sum of squares of degrees in a graph , 1998, Discret. Math..

[3] R. Graham,et al. Handbook of Combinatorics , 1995 .

[4] Some extremal problems concerning the square of a (0,1)-matrix , 1987 .

[5] Richard A. Brualdi,et al. Combinatorial matrix theory , 1991 .

[6] W. Haemers,et al. Association schemes , 1996 .

[7] R. Ahlswede,et al. Graphs with maximal number of adjacent pairs of edges , 1978 .

[8] Frantisek Matús,et al. Short Proofs of Khintchine-Type Inequalities for Zero-One Matrices , 1992, J. Comb. Theory, Ser. A.