Vulnerability in graphs: the neighbour-integrity of line graphs (Q4663308)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2150696
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Vulnerability in graphs: the neighbour-integrity of line graphs |
scientific article; zbMATH DE number 2150696 |
Statements
Vulnerability in graphs: the neighbour-integrity of line graphs (English)
0 references
30 March 2005
0 references
communication network
0 references
connectivity
0 references
neighbour-integrity
0 references
0.8553138971328735
0 references
0.826522707939148
0 references
0.8196076154708862
0 references
0.8154428005218506
0 references
The neighbor-integrity is one of the measures of the stability of a communication network. For a graph \(G\), this invariant is defined to be NI\((G)=\min\{{| S| +m(G-S)\}}\), where the minimum runs over all subsets \(S\) of vertices of \(G\), and \(m(G-S)\) is the order of a largest component in \(G-S\). In the paper some results on the neighbor-integrity of line graphs are given.
0 references