Graph operations and neighbor-integrity

Alpay Kırlangıc

Mathematica Bohemica (2004)

  • Volume: 129, Issue: 3, page 245-254
  • ISSN: 0862-7959

Abstract

top
Let G be a graph. A vertex subversion strategy of G , say S , is a set of vertices in G whose closed neighborhood is removed from G . The survival-subgraph is denoted by G / S . The Neighbor-Integrity of G , N I ( G ) , is defined to be N I ( G ) = min S ⊆ V ( G ) { | S | + c ( G / S ) } , where S is any vertex subversion strategy of G , and c ( G / S ) is the maximum order of the components of G / S . In this paper we give some results connecting the neighbor-integrity and binary graph operations.

How to cite

top

Kırlangıc, Alpay. "Graph operations and neighbor-integrity." Mathematica Bohemica 129.3 (2004): 245-254. <http://eudml.org/doc/249398>.

@article{Kırlangıc2004,
abstract = {Let $G$ be a graph. A vertex subversion strategy of $G$, say $S$, is a set of vertices in $G$ whose closed neighborhood is removed from $G$. The survival-subgraph is denoted by $G/S$. The Neighbor-Integrity of $G$, $\mathop \{\mathrm \{N\}I\}(G)$, is defined to be $\mathop \{\mathrm \{N\}I\}(G) = \min _\{S\subseteq V(G)\} \lbrace |S|+c(G/S)\rbrace $, where $S$ is any vertex subversion strategy of $G$, and $c(G/S)$ is the maximum order of the components of $G/S$. In this paper we give some results connecting the neighbor-integrity and binary graph operations.},
author = {Kırlangıc, Alpay},
journal = {Mathematica Bohemica},
keywords = {vulnerability; integrity; neighbor-integrity; vulnerability; integrity; neighbor-integrity},
language = {eng},
number = {3},
pages = {245-254},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Graph operations and neighbor-integrity},
url = {http://eudml.org/doc/249398},
volume = {129},
year = {2004},
}

TY - JOUR
AU - Kırlangıc, Alpay
TI - Graph operations and neighbor-integrity
JO - Mathematica Bohemica
PY - 2004
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 129
IS - 3
SP - 245
EP - 254
AB - Let $G$ be a graph. A vertex subversion strategy of $G$, say $S$, is a set of vertices in $G$ whose closed neighborhood is removed from $G$. The survival-subgraph is denoted by $G/S$. The Neighbor-Integrity of $G$, $\mathop {\mathrm {N}I}(G)$, is defined to be $\mathop {\mathrm {N}I}(G) = \min _{S\subseteq V(G)} \lbrace |S|+c(G/S)\rbrace $, where $S$ is any vertex subversion strategy of $G$, and $c(G/S)$ is the maximum order of the components of $G/S$. In this paper we give some results connecting the neighbor-integrity and binary graph operations.
LA - eng
KW - vulnerability; integrity; neighbor-integrity; vulnerability; integrity; neighbor-integrity
UR - http://eudml.org/doc/249398
ER -

References

top
  1. Counterexamples to the theorems of integrity of prisms and ladders, J. Comb. Math. Comb. Comput. 34 (2000), 119–127. (2000) MR1772790
  2. 10.1016/0166-218X(92)90122-Q, Discrete Appl. Math. 37/38 (1992), 13–28. (1992) MR1176842DOI10.1016/0166-218X(92)90122-Q
  3. 10.1016/0012-365X(94)90084-1, Discrete Math. 124 (1994), 3–12. (1994) MR1258837DOI10.1016/0012-365X(94)90084-1
  4. Vulnerability in graphs—a comparative survey, J. Comb. Math. Comb. Comput. 1 (1987), 13–22. (1987) MR0888829
  5. Stability measures and data fusion networks, Graph Theory of New York 26 (1994), 8–14. (1994) 
  6. The tenacity of a graph, Graph theory, combinatorics, algorithms and applications, Alavi, Y. et al. (eds.), Wiley, New York, 1995, pp. 1111–1122. (1995) MR1405887
  7. Edge-neighbor-integrity of trees, Australas J. Comb. 10 (1994), 163–174. (1994) MR1296949
  8. Vertex-neighbor-integrity of trees, Ars. Comb. 43 (1996), 169–180. (1996) MR1415985
  9. Bounds of edge-neighbor-integrity of graphs, Australas J. Comb. 15 (1997), 71–80. (1997) MR1448231
  10. 10.1080/16073606.1990.9631613, Quaest. Math. 13 (1990), 217–232. (1990) MR1068711DOI10.1080/16073606.1990.9631613
  11. 10.1016/S0012-365X(99)00352-0, Discrete Math. 216 (2000), 257–266. (2000) Zbl0957.05067MR1750866DOI10.1016/S0012-365X(99)00352-0
  12. Graph Theory, Addison-Wesley Publishing Company, 1969. (1969) Zbl0196.27202MR0256911
  13. The edge-integrity of some graphs, J. Comb. Math. Comb. Comput. 37 (2001), 139–148. (2001) MR1834438
  14. 10.1080/00207160008805006, Int. J. Comput. Math. 76 (2000), 25–33. (2000) MR1808796DOI10.1080/00207160008805006

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.