On the Connected Safe Number of Some Classes of Graphs
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 card...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2021/9483892 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|---|
| ISSN: | 2314-4629 2314-4785 |