A class of inequalities relating degrees of adjacent nodes to the average degree in edge-weighted uniform hypergraphs. (15th December 2005)
- Record Type:
- Journal Article
- Title:
- A class of inequalities relating degrees of adjacent nodes to the average degree in edge-weighted uniform hypergraphs. (15th December 2005)
- Main Title:
- A class of inequalities relating degrees of adjacent nodes to the average degree in edge-weighted uniform hypergraphs
- Authors:
- Johnson, P. D.
Mohapatra, R. N. - Abstract:
- 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.
- Is Part Of:
- International journal of mathematics and mathematical sciences. Number 21(2005)
- Journal:
- International journal of mathematics and mathematical sciences
- Issue:
- Number 21(2005)
- Issue Display:
- Volume 21, Issue 21 (2005)
- Year:
- 2005
- Volume:
- 21
- Issue:
- 21
- Issue Sort Value:
- 2005-0021-0021-0000
- Page Start:
- 3419
- Page End:
- 3426
- Publication Date:
- 2005-12-15
- Subjects:
- Mathematics -- Periodicals
510.5 - Journal URLs:
- https://www.hindawi.com/journals/ijmms/ ↗
- DOI:
- 10.1155/IJMMS.2005.3419 ↗
- Languages:
- English
- ISSNs:
- 0161-1712
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library HMNTS - ELD Digital store
- Ingest File:
- 10896.xml