A measure of graph vulnerability: scattering number
The scattering number of a graph G, denoted sc(G), is defined by sc(G)=max{c(G−S)−|S|:S⫅V(G) and c(G−S)≠1} where c(G−S) denotes the number of components in G−S. It is one measure of graph vulnerability. In this paper, general results on the scattering number of a graph are considered. Firstly,...
Saved in:
| Main Author: | Alpay Kirlangiç |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2002-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Online Access: | http://dx.doi.org/10.1155/S0161171202012607 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Computing the Weighted Isolated Scattering Number of Interval Graphs in Polynomial Time
by: Fengwei Li, et al.
Published: (2019-01-01) -
Graphs with Total Domination Number Double of the Matching Number
by: Selim Bahadır
Published: (2024-12-01) -
On the Basis Number of Some Special Graphs for Mycielski’s Graph
by: Ghassan Marougi, et al.
Published: (2011-12-01) -
On the basis number of the corona of graphs
by: Mohammad Shakhatreh, et al.
Published: (2006-01-01) -
The hull number of an oriented graph
by: Gary Chartrand, et al.
Published: (2003-01-01)