EconPapers    
Economics at your fingertips  
 

On Cyclic-Vertex Connectivity of - Star Graphs

Yalan Li, Shumin Zhang and Chengfu Ye

Mathematical Problems in Engineering, 2021, vol. 2021, 1-4

Abstract:

A vertex subset is a cyclic vertex-cut of a connected graph if is disconnected and at least two of its components contain cycles. The cyclic vertex-connectivity is denoted as the cardinality of a minimum cyclic vertex-cut. In this paper, we show that the cyclic vertex-connectivity of the - star network is for any integer and .

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2021/5570761.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2021/5570761.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:5570761

DOI: 10.1155/2021/5570761

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().

 
Page updated 2025-03-19
Handle: RePEc:hin:jnlmpe:5570761