Skip to main content
SpringerLink
Log in

On the Weak-Integrity of Graphs

  • Published:
Journal of Mathematical Modelling and Algorithms

Abstract

Connectivity has been used in the past to describe the stability of graphs. If two graphs have the same connectivity, then it does not distinguish between these graphs. That is, the connectivity is not a good measure of graph stability. Then we need other graph parameters to describe the stability. Suppose that two graphs have the same connectivity and the order (the number of vertices or edges) of the largest components of these graphs are not equal. Hence, we say that these graphs must be different in respect to stability and so we can define a new measure which distinguishes these graphs. In this paper, the Weak-Integrity of a graph G is introduced as a new measure of stability in this sense and it is defined as I w (G)=min  S⊂V(G){S+m e (G−S)}, where m e (G−S) denotes the number of edges of the largest component of G−S. We give the weak-integrity of graphs obtained via various operations that are unary, such as powers, and binary, such as union, composition, product and corona.

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. Atıcı, M. and Kırlangıc, A.: Counterexamples to the theorems of integrity of prisms and ladders, J. Combin. Math. Combin. Comput. 34 (2000), 119–127.

    Google Scholar 

  2. Bagga, K. S. and Deogun, J. S.: A variation on the edge-integrity, Congr. Numer. 94 (1992), 207–211.

    Google Scholar 

  3. Bagga, K. S. and Deogun, J. S.: On the pure edge-integrity of graphs, In: Graph Theory, Combinatorics, and Algorithms, Vols 1, 2, Kalamazoo, MI, 1992, pp. 301–310.

    Google Scholar 

  4. Bagga, K. S., Beineke, L. W., Goddard, W. D., Lipman, M. J. and Pippert, R. E.: A survey of integrity, Discrete Appl. Math. 37/38 (1992), 13–28.

    Google Scholar 

  5. Barefoot, C. A., Entringer, R. and Swart, H. C.: Vulnerability in graphs - a comparative survey, J. Combin. Math. Combin. Comput. 1 (1987), 13–22.

    Google Scholar 

  6. Barefoot, C. A., Entringer, R. and Swart, H. C.: Integrity of trees and powers of cycles, Congr. Numer. 58 (1987), 103–114.

    Google Scholar 

  7. Choudum, A. S. and Priya, N.: Tenacity of complete graph products and grids, Networks 34 (1999), 192–196.

    Google Scholar 

  8. Cozzens, M. B.: Stability measures and data fusion networks, Graph Theory Notes New York XXVI (1994), 8–14.

    Google Scholar 

  9. Cozzens, M. B., Moazzami, D. and Stueckle, S.: The tenacity of a graph, In: Proc. Seventh Internat. Conf. Theory and Applications of Graphs, Wiley, New York, 1995, pp. 1111–1122.

    Google Scholar 

  10. Harary, F.: Graph Theory, Addison-Wesley, New York, 1972.

    Google Scholar 

  11. Kırlangıc., A.: The edge-integrity of some graphs, J. Combin. Math. Combin. Comput. 37 (2001), 139–148.

    Google Scholar 

  12. Kırlangıc., A. and Ozan, A.: The neighbour-integrity of total graphs, Internat. J. Comput. Math. 76(1) (2000), 25–33.

    Google Scholar 

  13. Piazza, B. L., Roberts, S. F. and Stueckle, K. S.: Edge-tenacious networks, Networks 25 (1995), 7–17.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Ege University, 35100, Bornova-Izmir, Turkey

    Alpay Kirlangic

Authors
  1. Alpay Kirlangic
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kirlangic, A. On the Weak-Integrity of Graphs. Journal of Mathematical Modelling and Algorithms 2, 81–95 (2003). https://doi.org/10.1023/A:1024945012302

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1024945012302

Search

Navigation