A class of inequalities relating degrees of adjacent nodes to the average degree in edge-weighted uniform hypergraphs

P. D. Johnson and R. N. Mohapatra

International Journal of Mathematics and Mathematical Sciences, 2005, vol. 2005, 1-8

Abstract:

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 class of inequalities in a wider context, that of edge-weighted uniform hypergraphs.

Date: 2005
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2005/743897.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2005/743897.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:743897

DOI: 10.1155/IJMMS.2005.3419

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().