Skip to main content

Integrity of P 2 x P n

  • Conference paper
  • 563 Accesses

Part of the book series: Trends in Mathematics ((TM))

Abstract

The vertex Integrity, (G),of a graph G is defined as

$$I\left( G \right) = min\left\{ {\left| S \right| + m\left( {G - S} \right)\left| S \right. \varsubsetneqq V\left( G \right)} \right\}$$

where m(G — S) is the order of the largest component of G — S. In this paper, we compute J (P 2 × P n ),the vertex integrity of the Cartesian product of P 2 and P n

Footnote

*Work of this author was supported by Faculty Improvement Programme of U.G.C.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K.S. Bagga, L.W. Beineke, Wayne Goddard, M.J. Lipman and R.E. Pippert, A survey of integrity, Discrete Applied Math. 37/38 13–28, 1992.

    Article  MathSciNet  Google Scholar 

  2. K.S. Bagga, L.W. Beineke and R.E. Pippert, The integrity of Prisms (Preliminary report), Abstracts Amer. Math. Soc. 10 12, 1989.

    Google Scholar 

  3. C.A. Barefoot, R. Entringer and H. Swart, Integrity of Trees and Powers of Cycles, Congr. Numer. 58 103–114, 1987.

    MathSciNet  Google Scholar 

  4. C.A. Barefoot, R. Entringer and H. Swart, Vulnerability of Graphs - A comparative survey, J. Combin. Math. Combin. Comput. 1 12–22, 1987.

    MathSciNet  Google Scholar 

  5. L.W. Bienke, Wayne Goddard and M.J,. Lipman, Graphs with maximum Edge integrity, ARS Combinatoria 46 119–127, 1997.

    MathSciNet  Google Scholar 

  6. L.H. Clark, R.C. Entringer and M. Fellows, Computational complexity of Integrity, J. Combin. Math. Combin. Comput. 2 179–191, 1987.

    MathSciNet  MATH  Google Scholar 

  7. S.A. Chaudam and N. Priya, Tenacity of Complete graph products and Grids, Networks, 34 192–196, 1999.

    Article  MathSciNet  Google Scholar 

  8. Wayne Goddard, Measure of Vulnarability - The Integrity Family, Networks, 24 207–213, 1994.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer Basel AG

About this paper

Cite this paper

Chawathe, P.D., Shende, S.A. (2002). Integrity of P 2 x P n . In: Agarwal, A.K., Berndt, B.C., Krattenthaler, C.F., Mullen, G.L., Ramachandra, K., Waldschmidt, M. (eds) Number Theory and Discrete Mathematics. Trends in Mathematics. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-8223-1_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-0348-8223-1_14

  • Publisher Name: Birkhäuser, Basel

  • Print ISBN: 978-3-0348-9481-4

  • Online ISBN: 978-3-0348-8223-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics