Skip to main content

Part of the book series: SpringerBriefs in Electrical and Computer Engineering ((BRIEFSELECTRIC))

Abstract

Graph theory is a useful tool to solve some problems in wireless communications, such as resource allocation [1], scheduling [2], and routing [3], etc. However, the conception of edge in graph theory can only model the pairwise relation, which might not be sufficient to model the multiple users relation. To model the relation among multiple users more accurately, such as cumulative interference, we introduce the hypergraph theory [4] which allows any subsets of the vertices set to be a hyperedge, instead of exactly two vertices defined in traditional graph.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. A. N. Zaki and A. O. Fapojuwo, “Optimal and Efficient Graph-Based Resource Allocation Algorithms for Multiservice Frame-Based OFDMA Networks”, IEEE Trans. Mobile Computing, vol. 10, no. 8, pp. 1175–1186, Aug. 2011.

    Google Scholar 

  2. J.-C. Chen, Y.-C. Wang, and J.-T. Chen, “A Novel Broadcast Scheduling Strategy Using Factor Graphs and the Sum-Product Algorithm”, IEEE Trans. Wireless Commun., vol. 5, no. 6, pp. 1241–1249, Jun. 2006.

    Google Scholar 

  3. H. Zhu, H. Zang, K. Zhu, and B. Mukherjee, “A Novel Generic Graph Model for Traffic Grooming in Heterogeneous WDM Mesh Networks”, IEEE/ACM Trans. Networking, vol. 11, no. 2, pp. 285–299, Apr. 2003.

    Google Scholar 

  4. C. Berge, Hypergraphs: combinatorics of finite sets. North-Holland publishing company, Amsterdam, Netherlands, 1989.

    MATH  Google Scholar 

  5. V. I. Voloshin, Introduction to Graph and Hypergraph Theory, Nova Science Publishers, New York City, NY, 2008.

    MATH  Google Scholar 

  6. C. Berge, Graphs and Hypergraphs. North-Holland publishing company, Amsterdam, Netherlands, 1973.

    MATH  Google Scholar 

  7. V. Voloshin, Coloring Mixed Hypergraphs:. North-Holland publishing company, Amsterdam, Netherlands, 2002.

    MATH  Google Scholar 

  8. X. Li, W. Hu, C. Shen, A. Dick, and Z. Zhang, “Context-Aware Hypergraph Construction for Robust Spectral Clustering”, IEEE Trans. Knowledge Data Eng., vol. 26, no. 10, pp. 2588–2597, Oct. 2014.

    Google Scholar 

  9. S. X. Yu and J. Shi, “Multiclass spectral clustering,” in Proc. IEEE ICCV, Nice, France, Oct. 2003.

    Google Scholar 

  10. T. T. Ngo, M. Bellalij, and Y. Saad, “The trace ratio optimization problem,” SIAM Rev., vol. 54, no. 3, pp. 545–569, 2012.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2018 The Author(s)

About this chapter

Cite this chapter

Zhang, H., Song, L., Han, Z., Zhang, Y. (2018). Basics of Hypergraph Theory. In: Hypergraph Theory in Wireless Communication Networks. SpringerBriefs in Electrical and Computer Engineering. Springer, Cham. https://doi.org/10.1007/978-3-319-60469-5_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-60469-5_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-60467-1

  • Online ISBN: 978-3-319-60469-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics