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

Super p-restricted edge connectivity of line graphs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2011
2011
2014
2014

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 9 publications
(1 citation statement)
references
References 27 publications
(29 reference statements)
0
1
0
Order By: Relevance
“…Furthermore, a λ (2) -connected graph is said to be λ (2) -optimal if λ (2) = ξ. Recent results on this property are obtained in [2,5,12,13,18,21,23]. Notice that if λ (2) ≤ δ, then λ (2) = λ.…”
Section: C C and Clearlymentioning
confidence: 99%
“…Furthermore, a λ (2) -connected graph is said to be λ (2) -optimal if λ (2) = ξ. Recent results on this property are obtained in [2,5,12,13,18,21,23]. Notice that if λ (2) ≤ δ, then λ (2) = λ.…”
Section: C C and Clearlymentioning
confidence: 99%