2011
DOI: 10.1016/j.ins.2011.05.010
|View full text |Cite
|
Sign up to set email alerts
|

A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
9
0

Year Published

2012
2012
2024
2024

Publication Types

Select...
8

Relationship

3
5

Authors

Journals

citations
Cited by 41 publications
(10 citation statements)
references
References 34 publications
(51 reference statements)
1
9
0
Order By: Relevance
“…Later, Cheng and Lipták [7], and Yang et al [20] determined κ 1 and κ 2 of Cayley graphs generated by transposition trees independently which is a supplement of Wan and Zhang's result. Lower bounds for κ k in m-ary n-dimensional hypercube were studied by Wu and Guo [19].…”
Section: Introductionmentioning
confidence: 82%
“…Later, Cheng and Lipták [7], and Yang et al [20] determined κ 1 and κ 2 of Cayley graphs generated by transposition trees independently which is a supplement of Wan and Zhang's result. Lower bounds for κ k in m-ary n-dimensional hypercube were studied by Wu and Guo [19].…”
Section: Introductionmentioning
confidence: 82%
“…We list the following known results due to Wang and Zhang. Cheng and Lipták [8], and Yang and Meng [26] generalized the result above to the Cayley graphs generated by transposition generating trees. 22]).…”
Section: The Outsider Neighbors Of the Vertices Inmentioning
confidence: 89%
“…Work related to the R g -connectivity for special networks and small values of g can be found in the literature see, for example, [3,9,11,19,22,27] . The following lemmas are very useful for proving our main results.…”
Section: Definition 25 [6]mentioning
confidence: 99%