Skip to main content
SpringerLink
Log in

Independent 2-Point Set Domination in Graphs

  • Conference paper
  • First Online:
Theoretical Computer Science and Discrete Mathematics (ICTCSDM 2016)

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

  • 738 Accesses

Abstract

A set D of vertices in a connected graph G is said to be an independent 2-point set dominating set (or in short i-2psd set) of G if D is an independent set and for every subset \(S \subseteq V - D\) there exists a non-empty subset \( T \subseteq D\) containing at most 2 vertices such that the induced subgraph \(\langle S \cup T \rangle \) is connected. In this paper we explore graphs which possess an i-2psd set.

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., Purnima, G.: On point set domination in graphs V: independent PSD-sets. J. Comb. Inf. Sys. Sci. 22(2), 133–148 (1997)

    MATH  MathSciNet  Google Scholar 

  2. Acharya, B.D., Purnima, G.: On point-set domination in graphs VI: quest to characterize blocks containing independent PSD-sets. Nat. Acad. Sci. Lett. 23, 171–176 (2000)

    MATH  MathSciNet  Google Scholar 

  3. Berge, C.: Graphs and Hypergraphs. North-Holland, Amsterdam (1985)

    MATH  Google Scholar 

  4. Cockayne, E.J., Hedetniemi, S.T.: Independence graphs. Congr. Numer. X, 471–491 (1974)

    MATH  MathSciNet  Google Scholar 

  5. Cockayne, E.J., Hedetniemi, S.T.: Towards a theory of domination in graphs. Networks 7, 247–261 (1977)

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  7. Ore, O.: Theory of graphs. Am. Math. Soc. Transl. 38, 206–212 (1962)

    MATH  Google Scholar 

  8. Purnima, G., Mukti, A., Deepti, J.: 2-point set domination number of a cactus. Gulf J. Math. 4(3), 80–89 (2016)

    MATH  MathSciNet  Google Scholar 

  9. West, D.B.: Introduction to Graph Theory. Prentice Hall Inc., Upper Saddle River (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Sri Venkateswara College, University of Delhi, New Delhi, 110021, Delhi, India

    Purnima Gupta & Deepti Jain

Authors
  1. Purnima Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Deepti Jain
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Deepti Jain .

Editor information

Editors and Affiliations

  1. Kalasalingam University, Krishnankoil, India

    S. Arumugam

  2. Ball State University, Muncie, Indiana, USA

    Jay Bagga

  3. Indiana University – Purdue University, Fort Wayne, Indiana, USA

    Lowell W. Beineke

  4. Indian Institute of Technology, New Delhi, India

    B.S. Panda

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Gupta, P., Jain, D. (2017). Independent 2-Point Set Domination in Graphs. In: Arumugam, S., Bagga, J., Beineke, L., Panda, B. (eds) Theoretical Computer Science and Discrete Mathematics. ICTCSDM 2016. Lecture Notes in Computer Science(), vol 10398. Springer, Cham. https://doi.org/10.1007/978-3-319-64419-6_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-64419-6_36

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-64418-9

  • Online ISBN: 978-3-319-64419-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation