JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.contributor.author | Vaidya, S.K. | |
| dc.contributor.author | Parmar, A.D. | |
| dc.date.accessioned | 2023-05-01T03:14:32Z | |
| dc.date.available | 2023-05-01T03:14:32Z | |
| dc.date.issued | 2019-05 | |
| dc.identifier.citation | Vaidya, S. K., & Parmar, A. D. Open packing number of some path related graphs. Journal of Applied Science and Computations, VI, 2019, 180-184. | en_US |
| dc.identifier.issn | 1076-5131 | |
| dc.identifier.uri | http://10.9.150.37:8080/dspace//handle/atmiyauni/808 | |
| dc.description.abstract | A subset S of vertices of G is an open packing of G if the open neighborhoods of the vertices of S are pairwise disjoint in G while open packing number of G is the maximum cardinality among all the open packing sets of G. We investigate open packing number of some graphs obtained from path. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Journal of Applied Science and Computations | en_US |
| dc.subject | neighborhood | en_US |
| dc.subject | packing | en_US |
| dc.subject | open packing | en_US |
| dc.title | Open packing number of some path related graphs | en_US |
| dc.type | Article | en_US |
