Panconnectivity and 2-connected claw-free graphs

Panconnectivity and 2-connected claw-free graphs

0.00 Avg rating0 Votes
Article ID: iaor19981822
Country: China
Volume: 9
Issue: 1
Start Page Number: 6
End Page Number: 12
Publication Date: Jan 1996
Journal: Journal of Systems Science and Complexity
Authors: ,
Abstract:

In this paper, the authors show that the two distinct vertices u and v of a 2-connected claw-free graph G of order n with minimum degree ≥ (n–2)/3 are [7,n]-panconnected whenever both G – u and G – v are 2-connected.

Reviews

Required fields are marked *. Your email address will not be published.