Skip to main content
SpringerLink
Log in

Locating-dominating sets in hypergraphs

  • Published:
Periodica Mathematica Hungarica Aims and scope Submit manuscript

Abstract

A hypergraph is a generalization of a graph where edges can connect any number of vertices. In this paper, we extend the study of locating-dominating sets to hypergraphs. Along with some basic results, sharp bounds for the location-domination number of hypergraphs in general and exact values with specified conditions are investigated. Moreover, locating-dominating sets in some specific hypergraphs are found.

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. B.D. Acharya, Domination in hypergraphs II, new directions, in Proceedings of International Conference ICDM (Mysore, 2008), pp. 1–16

  2. B.D. Acharya, Domination in hypergraphs. AKCE J. Combin. 4(2), 117–126 (2007)

    MathSciNet  MATH  Google Scholar 

  3. C. Berg, Hypergraphs: Combinatoric of Finite Sets (Elsevier, North-Holland, 1989)

    Google Scholar 

  4. A. Behr, L. Camarinopoulos, On the domination of hypergraphs by their edges. Discret. Math. 187, 31–38 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  5. N. Bertrand, I. Charon, O. Hudry, A. Lobstein, Identifying and locating-dominating codes on chains and cycles. Eur. J. Comb. 25, 969–987 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  6. J. Caceres, C. Hernando, M. Mora, I.M. Pelayo, M.L. Puertas, Locating dominating codes. Appl. Math. Comput. 220, 38–45 (2013)

    MathSciNet  MATH  Google Scholar 

  7. I. Charon, O. Hudry, A. Lobstein, Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. Theor. Comput. Sci. 290, 2109–2120 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  8. I. Charon, O. Hudry, A. Lobstein, Identifying and locating-dominating codes: NP-completeness results for directed graphs. IEEE Trans. Inform. Theory 48, 2192–2200 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  9. C.J. Colbourn, P.J. Slater, L.K. Stewart, Locating-dominating sets in series parallel networks. Congr. Numer. 56, 135–162 (1987)

    MathSciNet  MATH  Google Scholar 

  10. A. Finbow, B.L. Hartnell, On locating-dominating sets and well-covered graphs. Congr. Numer. 56, 135–162 (1987)

    MathSciNet  MATH  Google Scholar 

  11. F. Harary, R.A. Melter, On the metric dimention of a graph. Ars Comb. 2, 191–195 (1976)

    MathSciNet  MATH  Google Scholar 

  12. I. Honkala, T. Laihonen, S. Ranto, On locating-dominating codes in binary Hamming spaces. Disc. Math. Theor. Comput. Sci. 6, 265–282 (2004)

    MathSciNet  MATH  Google Scholar 

  13. B.K. Jose, Z. Tuza, Hypergraph domination and strong independnce. Appl. Anal. Disc. Math. 3, 347–358 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  14. D.F. Rall, P.J. Slater, On location-domination numbers for certian classes of graphs. Congr. Numer. 45, 97–106 (1984)

    MathSciNet  Google Scholar 

  15. E.R. Scheinerman, D.H. Ullman, Fractional graph theory (Wiley, New York, 2008)

    Google Scholar 

  16. P.J. Slater, Fault-tolerant locating-dominating sets. Discret. Math. 249, 179–189 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  17. P.J. Slater, Dominating and reference sets in a graph. J. Math. Phys. Sci. 22, 445–455 (1988)

    MathSciNet  MATH  Google Scholar 

  18. P.J. Slater, Dominating and location in acyclic in graphs. Networks 17, 55–64 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  19. P.J. Slater, Leaves of trees. in Proceedings of 6th Southeastern Conference on Combinatorics, Graph theory, and Computing. Congressus Numerantium, vol 14 (1975), pp 549–559

Download references

Acknowledgments

The authors are grateful to the referee(s) whose valuable suggestions resulted in producing an improved paper.

Author information

Authors and Affiliations

  1. Centre for Advanced Studies in Pure and Applied Mathematics, Bahauddin Zakariya University Multan, Multan, Pakistan

    Muhammad Fazil, Imran Javaid, Muhammad Salman & Usman Ali

Authors
  1. Muhammad Fazil
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Imran Javaid
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Muhammad Salman
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Usman Ali
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Imran Javaid.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Fazil, M., Javaid, I., Salman, M. et al. Locating-dominating sets in hypergraphs. Period Math Hung 72, 224–234 (2016). https://doi.org/10.1007/s10998-016-0121-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10998-016-0121-8

Keywords

Mathematics Subject Classification

Search

Navigation