A note on the integrity of middle graphs

Authors:
Aygul Mamut;Elkin Vumar
Affiliations:
College of Mathematics and System Sciences, Xinjiang University, Urumqi, P.R. China;College of Mathematics and System Sciences, Xinjiang University, Urumqi, P.R. China
Venue:
CJCDGCGT'05 Proceedings of the 7th China-Japan conference on Discrete geometry, combinatorics and graph theory
Year:
2005

Citing 5
Cited 0

A survey of integrity

Discrete Applied Mathematics - Special double volume: interconnection networks
Edge-integrity: a survey

Proceedings of the first Malta conference on Graphs and combinatorics
Measuring the vulnerability for classes of intersection graphs

Discrete Applied Mathematics
The integrity of a cubic graph

Discrete Applied Mathematics
Graph Theory With Applications

Graph Theory With Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The integrity I(G) of a noncomplete connected graph G is a measure of network invulnerability and is defined by I(G) = min{|S + m(G - S)}, where S and m(G - S) denote the the subset of V and the order of the largest component of G - S, respectively. In this paper, we determine the integrity and some other parameters of middle graphs of some classes of graphs.