Geodesic
Graph operations and neighbor-integrity
Mathematica Bohemica, Tome 129 (2004) no. 3, pp. 245-254

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

MR Zbl
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 NI}(G)$, is defined to be $\mathop {\mathrm NI}(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.
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 NI}(G)$, is defined to be $\mathop {\mathrm NI}(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.
DOI : 10.21136/MB.2004.134145
Classification : 05C40, 05C85
Keywords: vulnerability; integrity; neighbor-integrity 
Kırlangıc, Alpay. Graph operations and neighbor-integrity. Mathematica Bohemica, Tome 129 (2004) no. 3, pp. 245-254. doi: 10.21136/MB.2004.134145
@article{10_21136_MB_2004_134145,
     author = {K{\i}rlang{\i}c, Alpay},
     title = {Graph operations and neighbor-integrity},
     journal = {Mathematica Bohemica},
     pages = {245--254},
     year = {2004},
     volume = {129},
     number = {3},
     doi = {10.21136/MB.2004.134145},
     mrnumber = {2092711},
     zbl = {1080.05515},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/MB.2004.134145/}
}
TY  - JOUR
AU  - Kırlangıc, Alpay
TI  - Graph operations and neighbor-integrity
JO  - Mathematica Bohemica
PY  - 2004
SP  - 245
EP  - 254
VL  - 129
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.21136/MB.2004.134145/
DO  - 10.21136/MB.2004.134145
LA  - en
ID  - 10_21136_MB_2004_134145
ER  - 
%0 Journal Article
%A Kırlangıc, Alpay
%T Graph operations and neighbor-integrity
%J Mathematica Bohemica
%D 2004
%P 245-254
%V 129
%N 3
%U http://geodesic.mathdoc.fr/articles/10.21136/MB.2004.134145/
%R 10.21136/MB.2004.134145
%G en
%F 10_21136_MB_2004_134145

[1] Atıcı, M.; Kırlangı, A.: Counterexamples to the theorems of integrity of prisms and ladders. J. Comb. Math. Comb. Comput. 34 (2000), 119–127. | MR

[2] Bagga, K. S.; Beineke, L. W.; Goddard, W. D.; Lipman, M. J.; Pippert, R. E.: A survey of integrity. Discrete Appl. Math. 37/38 (1992), 13–28. | DOI | MR

[3] Bagga, K. S.; Beineke, L. W.; Lipman, M. J.; Pippert, R. E.: Edge-integrity: a survey. Discrete Math. 124 (1994), 3–12. | DOI | MR

[4] Barefoot, C. A.; Entringer, R.; Swart, H.: Vulnerability in graphs—a comparative survey. J. Comb. Math. Comb. Comput. 1 (1987), 13–22. | MR

[5] Cozzens, M. B.: Stability measures and data fusion networks. Graph Theory of New York 26 (1994), 8–14.

[6] Cozzens, M. B.; Moazzami, D.; Stueckle, S.: The tenacity of a graph. Graph theory, combinatorics, algorithms and applications, Alavi, Y. et al. (eds.), Wiley, New York, 1995, pp. 1111–1122. | MR

[7] Cozzens, M. B.; Wu, S. Y.: Edge-neighbor-integrity of trees. Australas J. Comb. 10 (1994), 163–174. | MR

[8] Cozzens, M. B.; Wu, S. Y.: Vertex-neighbor-integrity of trees. Ars. Comb. 43 (1996), 169–180. | MR

[9] Cozzens, M. B.; Wu, S. Y.: Bounds of edge-neighbor-integrity of graphs. Australas J. Comb. 15 (1997), 71–80. | MR

[10] Goddard, W.; Swart, H. C.: On the toughness of a graph. Quaest. Math. 13 (1990), 217–232. | DOI | MR

[11] Gambrell, Marci J.: Vertex-neighbor-integrity of magnifiers, expanders and hypercubes. Discrete Math. 216 (2000), 257–266. | DOI | MR | Zbl

[12] Harary, F.: Graph Theory. Addison-Wesley Publishing Company, 1969. | MR | Zbl

[13] Kırlangı, A.: The edge-integrity of some graphs. J. Comb. Math. Comb. Comput. 37 (2001), 139–148. | MR

[14] Kırlangı, A.; Ozan, A.: The neighbour-integrity of total graphs. Int. J. Comput. Math. 76 (2000), 25–33. | DOI | MR

Cité par Sources :