a class of inequalities relating degrees of adjacent nodes to the average degree in edge-weighted uniform hypergraphs类有关的不平等程度的相邻节点edge-weighted统一超图的平均程度.pdfVIP

A CLASS OF INEQUALITIES RELATING DEGREES OF ADJACENT NODES TO THE AVERAGE DEGREE IN EDGE-WEIGHTED UNIFORM HYPERGRAPHS P. D. JOHNSON JR. AND R. N. MOHAPATRA Received 26 August 2004 and in revised form 28 September 2005 In 1986, Johnson and Perry proved a class of inequalities for uniform hypergraphs which included the following: for any such hypergraph, the geometric mean over the hyperedges of the geometric means of the degrees of the nodes on the hyperedge is no less than the average degree in the hypergraph, with equality only if the hypergraph is regular. Here, we prove a wider cl