Skip to main content
SpringerLink
Log in

The Spectral Radius and Domination Number of Uniform Hypergraphs

  • Conference paper
  • First Online:
Book cover Combinatorial Optimization and Applications (COCOA 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10628))

Abstract

This paper investigates the spectral radius and signless Laplacian spectral radius of linear uniform hypergraphs. A dominating set in a hypergraph H is a subset D of vertices if for every vertex v not in D there exists \(u\in D\) such that u and v are contained in a hyperedge of H. The minimum cardinality of a dominating set of H is called the domination number of H. We give lower bounds on the spectral radius and signless Laplacian spectral radius of a linear uniform hypergraph in terms of its domination number.

Research was partially supported by NSFC (grant numbers 11571222,11471210).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Acharya, B.D.: Domination in hypergraphs. AKCE J. Comb. 4, 117–126 (2007)

    MATH  MathSciNet  Google Scholar 

  2. Aouchiche, M., Hansen, P., Stevanović, D.: A sharp upper bound on algebraic connectivity using domination number. Linear Algebra Appl. 432, 2879–2893 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  3. Brand, C., Seifter, N.: Eigenvalues and domination in graphs. Math. Slovaca 46, 33–39 (1996)

    MATH  MathSciNet  Google Scholar 

  4. Bujtás, C., Henning, M.A., Tuza, Z.: Transversals and domination in uniform hypergraphs. Eur. J. Comb. 33, 62–71 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  5. Chang, K., Pearson, K., Zhang, T.: Perron-Frobenius theorem for nonegative tensors. Commun. Math. Sci. 6, 507–520 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  6. Chang, K., Qi, L., Zhang, T.: A survey on the spectral theory of nonnegative tensors. Numer. Linear Algebra Appl. 20, 891–912 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  7. Cooper, J., Dutle, A.: Spectra of uniform hypergraphs. Linear Algebra Appl. 436, 3268–3292 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  8. Friedland, S., Gaubert, A., Han, L.: Perron-Frobenius theorems for nonnegative multilinear forms and extensions. Linear Algebra Appl. 438, 738–749 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  9. Har, J.: A note on Laplacian eigenvalues and domination. Linear Algebra Appl. 449, 115–118 (2014)

    Article  MATH  MathSciNet  Google Scholar 

  10. Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker Inc., New York (1998)

    MATH  Google Scholar 

  11. Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in Graphs: Advanced Topics. Marcel Dekker Inc., New York (1998)

    MATH  Google Scholar 

  12. Henning, M.A., Löwenstein, C.: Hypergraphs with large domination number and edge sizes at least 3. Discrete Appl. Math. 160, 1757–1765 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  13. Henning M.A., Yeo, A.: Total Domination in Graphs. Springer Monographs in Mathematics. Springer, New York (2013). 14

    Google Scholar 

  14. Hu, S., Qi, L., Shao, J.: Cored hypergraphs, power hypergraphs and their Laplacian \(H\)-eigenvalues. Linear Algebra Appl. 439, 2980–2998 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  15. Hu, S., Qi, L., Xie, J.: The largest Laplacian and signless Laplacian \(H\)-eigenvalues of a uniform hypergraph. Linear Algebra Appl. 469, 1–27 (2015)

    Article  MATH  MathSciNet  Google Scholar 

  16. Jose, B.K., Tuza, Z.: Hypergraph domination and strong independence. Appl. Anal. Discrete Math. 3, 237–358 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  17. Kang, L., Li, S., Dong, Y., Shan, E.: Matching and domination numbers in \(r\)-uniform hypergraphs. J. Comb. Optim. (2017). https://doi.org/10.1007/s10878-016-0098-5

    MATH  MathSciNet  Google Scholar 

  18. Lim, L.H.: Singular values and eigenvalues of tensors: a variational approach. In: Proceedings of the IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMSAP 2005, vol. 1, pp. 129–132 (2005)

    Google Scholar 

  19. Lu, L., Man, S.: Connected hypergraphs with small spectral radius. Linear Algebra Appl. 508, 206–227 (2016)

    Article  MATH  MathSciNet  Google Scholar 

  20. Nikiforov, V.: Bounds on graph eignvalues I. Linear Algebra Appl. 420, 667–671 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  21. Qi, L.: Eigenvalues of a real supersymmetric tensor. J. Symb. Comput. 40, 1302–1324 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  22. Shao, J.: A general product of tensors with applications. Linear Algebra Appl. 439, 2350–2366 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  23. Xing, R., Zhou, B.: Laplacian and signless Laplacian spectral radii of graphs with fixed domination number. Math. Nachr. 188, 476–480 (2015)

    Article  MATH  MathSciNet  Google Scholar 

  24. Yang, Y., Yang, Q.: Further results for Perron-Frobenius theorem for nonnegative tensors. SIAM J. Matrix Anal. Appl. 31, 2517–2530 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  25. Yang, Y., Yang, Q.: On some properties of nonegative weakly irreducible tensors. arXiv: 1111.0713v2 (2011)

  26. Zhou, J., Sun, L., Wang, W., Bu, C.: Some spaectral properties of uniform hypergraphs. Electron. J. Combin. 21, #P4.24 (2014)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Shanghai University, Shanghai, 200444, People’s Republic of China

    Liying Kang & Wei Zhang

  2. School of Management, Shanghai University, Shanghai, 200444, People’s Republic of China

    Erfang Shan

Authors
  1. Liying Kang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wei Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Erfang Shan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Erfang Shan .

Editor information

Editors and Affiliations

  1. Shanghai Jiao Tong University, Shanghai, China

    Xiaofeng Gao

  2. Harbin Institute of Technology, Shenzhen, China

    Hongwei Du

  3. Kennesaw State University, Kennesaw, Georgia, USA

    Meng Han

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kang, L., Zhang, W., Shan, E. (2017). The Spectral Radius and Domination Number of Uniform Hypergraphs. In: Gao, X., Du, H., Han, M. (eds) Combinatorial Optimization and Applications. COCOA 2017. Lecture Notes in Computer Science(), vol 10628. Springer, Cham. https://doi.org/10.1007/978-3-319-71147-8_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-71147-8_21

  • Published:

  • Publisher Name: Springer, Cham

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

  • Online ISBN: 978-3-319-71147-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation