On the Connected Safe Number of Some Classes of Graphs

Rakib Iqbal, Muhammad Shoaib Sardar, Dalal Alrowaili, Sohail Zafar, Imran Siddique and Muhammad Kamran Siddiqui

Journal of Mathematics, 2021, vol. 2021, 1-4

Abstract: For a connected simple graph G, a nonempty subset S of VG is a connected safe set if the induced subgraph GS is connected and the inequality S≥D satisfies for each connected component D of G∖S whenever an edge of G exists between S and D. A connected safe set of a connected graph G with minimum cardinality is called the minimum connected safe set and that minimum cardinality is called the connected safe numbers. We study connected safe sets with minimal cardinality of the ladder, sunlet, and wheel graphs.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2021/9483892.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2021/9483892.xml (application/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:jjmath:9483892

DOI: 10.1155/2021/9483892

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().