A class of inequalities relating degrees of adjacent nodes to the average degree in edge-weighted uniform hypergraphs
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, wi...
Saved in:
Main Authors: | P. D. Johnson, R. N. Mohapatra |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2005-01-01
|
Series: | International Journal of Mathematics and Mathematical Sciences |
Online Access: | http://dx.doi.org/10.1155/IJMMS.2005.3419 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On Omega Index and Average Degree of Graphs
by: Sadik Delen, et al.
Published: (2021-01-01) -
Measurement of degree of non-uniformity of electric field
by: S. S. Kolmogorova, et al.
Published: (2018-04-01) -
Characterization and recognition of edge intersection graphs of trichromatic hypergraphs with finite multiplicity in the class of split graphs
by: T. V. Lubasheva
Published: (2018-12-01) -
Exploration Degree Bias: The Hidden Influence of Node Degree in Graph Neural Network-Based Reinforcement Learning
by: Peter Tarabek, et al.
Published: (2025-01-01) -
Comparison of modularity-based approaches for nodes clustering in hypergraphs
by: Poda, Veronica, et al.
Published: (2024-03-01)