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/