Advertisement
Published in:
2009 | OriginalPaper | Chapter
On Integrity of Harary Graphs
Authors : Fengwei Li, Qingfang Ye, Baohuai Sheng
Published in: Combinatorial Optimization and Applications
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
The integrity of a graph
G
= (
V
,
E
) is defined as
I
(
G
) =
min
{|
S
| +
m
(
G
−
S
):
S
⊆
V
(
G
)}, where
m
(
G
−
X
) denotes the order of the largest component in the graph
G
−
X
. This is a better parameter to measure the stability of a network
G
, as it takes into account both the amount of work done to damage the network and how badly the network is damaged. In this paper, we give the exact values or bounds for the integrity of Harary graphs.