The average lower connectivity of graphs
type: Item
instance of: scholarly article
title: The average lower connectivity of graphs
zbMATH Open document ID: 1406.05053
DOI: 10.1155/2014/807834
author: Ersin Aslan
published in: Journal of Applied Mathematics
publication date: 2019-02-01T00:00:00Z
review text: Summary: For a vertex \(v\) of a graph \(G\), the \textit{lower connectivity}, denoted by \(s_v(G)\), is the smallest number of vertices that contains \(v\) and those vertices whose deletion from \(G\) produces a disconnected or a trivial graph. The average lower connectivity denoted by \(\kappa_{\mathrm{av}}(G)\) is the value \((\sum_{v\in V(G)}s_v(G))/|V(G)|\). It is shown that this parameter can be used to measure the vulnerability of networks. This paper contains results on bounds for the average lower connectivity and obtains the average lower connectivity of some graphs.
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C90
zbMATH DE Number: 7010757
Wikidata QID: Q59052474
MaRDI profile type: MaRDI publication profile
full work available at URL: https://doi.org/10.1155/2014/807834
OpenAlex ID: W2012572972
description: scientific article; zbMATH DE number 7010757