E-resources
-
Hong, Zhen-Mu; Lai, Hong-Jian; Xia, Zheng-Jiang
Linear algebra and its applications, 12/2020, Volume: 607Journal Article
Let κ′(G), μn−1(G) and μ1(G) denote the edge-connectivity, the algebraic connectivity and the Laplacian spectral radius of G, respectively. In this paper, we prove that for integers k≥2 and r≥2, and any simple graph G of order n with minimum degree δ≥k, girth g≥3 and clique number ω(G)≤r, the edge-connectivity κ′(G)≥k if μn−1(G)≥(k−1)nN(δ,g)(n−N(δ,g)) or if μn−1(G)≥(k−1)nφ(δ,r)(n−φ(δ,r)), where N(δ,g) is the Moore bound on the smallest possible number of vertices such that there exists a δ-regular simple graph with girth g, and φ(δ,r)=max{δ+1,⌊rδr−1⌋}. Analogue results involving μn−1(G) and μ1(G)μn−1(G) to characterize vertex-connectivity of graphs with fixed girth and clique number are also presented. Former results in Liu et al. (2013) 22, Liu et al. (2019) 20, Hong et al. (2019) 15, Liu et al. (2019) 21 and Abiad et al. (2018) 1 are improved or extended.
![loading ... loading ...](themes/default/img/ajax-loading.gif)
Shelf entry
Permalink
- URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year | Impact factor | Edition | Category | Classification | ||||
---|---|---|---|---|---|---|---|---|
JCR | SNIP | JCR | SNIP | JCR | SNIP | JCR | SNIP |
Select the library membership card:
If the library membership card is not in the list,
add a new one.
DRS, in which the journal is indexed
Database name | Field | Year |
---|
Links to authors' personal bibliographies | Links to information on researchers in the SICRIS system |
---|
Source: Personal bibliographies
and: SICRIS
The material is available in full text. If you wish to order the material anyway, click the Continue button.