| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Vaidya, S.K. | - |
| dc.contributor.author | Parmar, A.D. | - |
| dc.date.accessioned | 2025-01-01T12:05:46Z | - |
| dc.date.available | 2025-01-01T12:05:46Z | - |
| dc.date.issued | 2019 | - |
| dc.identifier.uri | http://10.9.150.37:8080/dspace//handle/atmiyauni/2216 | - |
| dc.description.abstract | A set S ⊆ V (G) of vertices in a graph G is called a packing of G if the closed neighborhood of the vertices of S are pairwise disjoint in G. A subset S of V (G) is called an open packing of G if the open neighborhood of the vertices of S are pairwise disjoint in G. We have investigated exact value of these parameters for triangular snakes. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | The International J. Mathematical Combinatorics | en_US |
| dc.relation.ispartofseries | 2;2019 | - |
| dc.subject | Neighborhood | en_US |
| dc.subject | Packing | en_US |
| dc.subject | Smarandache k-packing | en_US |
| dc.subject | Open packing | en_US |
| dc.title | Open Packing Number of Triangular Snakes | en_US |
| dc.type | Article | en_US |
| Appears in Collections: | 01. Journal Articles | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Open Packing Number of Triangular Snakes.pdf | 797.14 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.