Skip to main content
SpringerLink
Log in

A Sharp Upper Bound on the Least Signless Laplacian Eigenvalue Using Domination Number

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

In this paper, we present a sharp upper bound for the least signless Laplacian eigenvalue of a graph involving its domination number. Moreover, we determine some extremal graphs which attain the sharp bound.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Cardoso D.M., Cvetković D., Rowlinson P., Simić S.K.: A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph. Linear Algebra Appl. 429, 2770–2780 (2008)

    Article  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. Fink J.F., Jacobson M.S., Kinch L.F., Roberts J.: On graphs having domination half their order. Period. Math. Hung. 16, 287–293 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  4. Payan C., Xuong N.H.: Domination-balanced graphs. J. Graph Theory 6, 23–32 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  5. Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs, Monographs and Textbooks in Pure and Applied Mathematics, vol. 208. Marcel Dekker Inc., New York (1998)

  6. Payan C.: Sur le Nombre d’Absorption d’un Graphe Simple. Cahiers Centre Études Recherche Opér. 17, 307–317 (1975)

    MATH  MathSciNet  Google Scholar 

  7. Volkmann L.: Upper bounds on the domination number of a graph in terms of order and minimum degree. Ars Combin. 81, 3–22 (2006)

    MATH  MathSciNet  Google Scholar 

  8. Cvetković D., Rowlinson P., Simić S.K.: Eigenvalue bounds for the signless Laplacian. Publ. Inst. Math. (Beograd, N.S.) 81(95), 11–27 (2007)

    Article  MathSciNet  Google Scholar 

  9. Cvetković, D., Doob, M., Sachs, H.: Spectra of Graphs Theory and Application. Academic Press, New York (1980)

    Google Scholar 

  10. Kinkar Ch, D.: On conjectures involving second largest signless Laplacian eigenvalue of graphs, Linear Algebra Appl. 432, 3018–3029 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  11. Xing H.M., Sun L., Chen X.G.: Domination in graphs of minimum degree five. Graphs Combin. 22, 127–143 (2006)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Science, University of Shanghai for Science and Technology, Shanghai, 200093, China

    Chang-Xiang He & Min Zhou

Authors
  1. Chang-Xiang He
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Min Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chang-Xiang He.

Rights and permissions

Reprints and permissions

About this article

Cite this article

He, CX., Zhou, M. A Sharp Upper Bound on the Least Signless Laplacian Eigenvalue Using Domination Number. Graphs and Combinatorics 30, 1183–1192 (2014). https://doi.org/10.1007/s00373-013-1330-z

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-013-1330-z

Keywords

Mathematics Subject Classification (2000)

Search

Navigation