Geodesic
Integrity of Total Graphs via Certain Parameters
Matematičeskie zametki, Tome 76 (2004) no. 5, pp. 714-722.

Voir la notice de l'article provenant de la source Math-Net.Ru

Communication networks have been characterized by high levels of service reliability. Links cuts, node interruptions, software errors or hardware failures, and transmission failures at various points can interrupt service for long periods of time. In communication networks, greater degrees of stability or less vulnerability is required. The vulnerability of communication network measures the resistance of the network to the disruption of operation after the failure of certain stations or communication links. If we think of a graph $G$ as modeling a network, many graph-theoretic parameters can be used to describe the stability of communication networks, including connectivity, integrity, and tenacity. We consider two graphs with the same connectivity, but with unequal orders of theirs largest components. Then these two graphs must be different in respect to stability. How can we measure that property? The idea behind the answer is the concept of integrity, which is different from connectivity. Total graphs constitute a large class of graphs. In this paper, we study the integrity of total graphs via some graph parameters. 
@article{MZM_2004_76_5_a6,
     author = {P. D\"undar and A. Ayta\c{c}},
     title = {Integrity of {Total} {Graphs} via {Certain} {Parameters}},
     journal = {Matemati\v{c}eskie zametki},
     pages = {714--722},
     publisher = {mathdoc},
     volume = {76},
     number = {5},
     year = {2004},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MZM_2004_76_5_a6/}
}
TY  - JOUR
AU  - P. Dündar
AU  - A. Aytaç
TI  - Integrity of Total Graphs via Certain Parameters
JO  - Matematičeskie zametki
PY  - 2004
SP  - 714
EP  - 722
VL  - 76
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MZM_2004_76_5_a6/
LA  - ru
ID  - MZM_2004_76_5_a6
ER  - 
%0 Journal Article
%A P. Dündar
%A A. Aytaç
%T Integrity of Total Graphs via Certain Parameters
%J Matematičeskie zametki
%D 2004
%P 714-722
%V 76
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MZM_2004_76_5_a6/
%G ru
%F MZM_2004_76_5_a6
P. Dündar; A. Aytaç. Integrity of Total Graphs via Certain Parameters. Matematičeskie zametki, Tome 76 (2004) no. 5, pp. 714-722. http://geodesic.mathdoc.fr/item/MZM_2004_76_5_a6/

[1] Kumar V., Grama A., Gupta A., Karpis G., Introduction To Parallel Computing, The Benjamin Cummings Publ., California, 1995

[2] Lesniak L., Chartrand G., Graphs and Digraphs, Wadsworth Brooks, California, 1986 | Zbl

[3] Cozzens M. B., Wu S. Y., “Edge neighbor-integrity of trees”, Austral. J. Combinatorics, 10 (1994), 163–174 | MR | Zbl

[4] Cozzens M. B., Yu. S. Y., “Vertex neighbor-integrity of trees”, Ars. Combinatorial, 43 (1996), 169–180 | MR | Zbl

[5] Chvatal V., “Tough graphs and Hamiltonian circuits”, Discrete Math., 5 (1973), 215–218 | DOI | MR

[6] Dündar P., “The tenacity of hypercube graphs and its some compounds”, Neural Networks World, 3/99 (1999), 225–234

[7] Dündar P., “Stability measures of some static interconnection networks”, Intern. J. Comput. Math., 76:4 (2001), 455–462 | DOI | MR

[8] Dündar P., “Accessibility number and the neighbour-integrity of generalised Petersen graphs”, Neural Network World, 2 (2001), 167–174

[9] Dündar P., Ozan A., “Stability measures of torus and mesh graphs”, Intern. J. Math. Algorithms, 2002 (to appear)

[10] Dündar P., Ozan A., “The neighbour-integrity of sequential joined graphs”, Intern. J. Comput. Math., 74 (2000), 45–52 | DOI | MR | Zbl

[11] Dündar P., “The neighbour-integrity of Boolean graphs and its compounds”, Intern. J. Comput. Math., 72 (1999), 441–447 | DOI | MR | Zbl

[12] Dündar P., “New notions in network reliability: stability numbers of sequential joined graphs”, Neural Network World, 5 (1999), 403–411

[13] Dündar P., “The stability measures of static interconnection networks and binary trees”, Proceeding of the Third International Symposium on Computer Networks, Izmir, 1998, 240–245

[14] Dündar P., Ten O., “A new parameter for network stability: the neighbour-tenacity”, Proceedings of the 14th Intern. Symposium on Comput. and Information Sciences, Kusadasi, 1999, 1016–1018

[15] Dündar P., Öztürk N., “The neighbour-integrity of recursive graphs”, Proceedings of the 2nd Intern. Symposium on Math. and Computational Applications, Baku, 1999, 443–447

[16] Bagga K. S., Beineke L. W., “Survey of integrity”, Discrete Appl. Math., 37/38 (1992), 13–28 | DOI | MR | Zbl

[17] Barefoot C. A., Entringer R., “Vulnerability in graphs—a comparative survey”, J. Combin. Math. Combin., 1989, 113–122

[18] Beinike L. W., Goddard W., Hamburger P., Kleitman D. J., Lipman M. J., Pippert R. E., “The integrity of the cube is small”, J. Combin. Math. Combin. Comput., 9 (1991), 191–193 | MR

[19] Goddard W., Swart H. C., “Integrity in graphs: bounds and basics”, J. Combin. Math. Combin. Comput., 7 (1990), 139–151 | MR | Zbl

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

[21] Bagga K. S., Beineke L. W., Lipman M. J., Pippert R. E., “On the edge-integrity of graphs”, Congres. Numer., 60 (1987), 141–144 | MR | Zbl

[22] Bagga K. S., Beineke L. W., Lipman M. J., Pippert R. E., Sedlmeyer R. L., “A good algorithm for the computation of the edge-integrity of trees”, Congres. Numer., 67 (1988), 225–232 | MR | Zbl

[23] Harary F., Graph Theory, Addison-Wesley Publ., California, 1971