Skip to main content

Global Location-Domination in the Join and Cartesian Product of Graphs

  • Conference paper
  • First Online:
Discrete and Computational Geometry, Graphs, and Games (JCDCGGG 2018)

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

  • 246 Accesses

Abstract

In this paper, global locating-dominating sets of the join and Cartesian product of graphs are characterized. Global location-domination numbers and bounds of these graphs and some special graphs are determined. The relationship between the location-domination numbers of the join of two graphs and its complement is also shown.

Supported by DOST-ASTHRDP, Philippines.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 44.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.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. Cáceres, J., Hernando, C., Mora, M., Pelayo, I.M., Puertas, M.L.: Locating-dominating codes: bounds and extremal cardinalities. Appl. Math. Comput. 220, 38–45 (2013)

    MathSciNet  MATH  Google Scholar 

  2. Canoy, S., Jr., Malacas, G.: Determining the intruder’s location in a given network: locating-dominating sets in a graph. NRCP Res. J. 13(1), 1–8 (2013)

    Google Scholar 

  3. Hernando, C., Mora, M., Pelayo, I.M.: Locating domination in bipartite graphs and their complements. Discret. Appl. Math. 263, 195–203 (2019)

    Article  MathSciNet  Google Scholar 

  4. Hernando, C., Mora, M., Pelayo, I.M.: Nordhaus-Gaddum bounds for locating domination. Eur. J. Comb. 36, 1–6 (2014)

    Article  MathSciNet  Google Scholar 

  5. Hernando, C., Mora, M., Pelayo, I.M.: On global location-domination in graphs. Ars Mathematica Contemporanea 8, 365–379 (2015)

    Article  MathSciNet  Google Scholar 

  6. Lobstein, A.: Watching systems, identifying, locating-dominating and discriminating codes in graphs. https://www.lri.enst.fr/lobstein/debutBIBidetlocdom.pdf

  7. Malacas, G., Malnegro, A.: Global location-domination in the lexicographic product and corona of graphs. Adv. Appl. Discret. Math. 20(1), 61–71 (2019). https://doi.org/10.17654/DM020010061

    Article  MATH  Google Scholar 

  8. Sampathkumar, E.: The global domination number of a graph. J. Math. Phys. Sci. 23, 377–385 (1989)

    MathSciNet  MATH  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Analen Malnegro .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Malnegro, A., Malacas, G. (2021). Global Location-Domination in the Join and Cartesian Product of Graphs. In: Akiyama, J., Marcelo, R.M., Ruiz, MJ.P., Uno, Y. (eds) Discrete and Computational Geometry, Graphs, and Games. JCDCGGG 2018. Lecture Notes in Computer Science(), vol 13034. Springer, Cham. https://doi.org/10.1007/978-3-030-90048-9_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-90048-9_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-90047-2

  • Online ISBN: 978-3-030-90048-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics