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 | 2024-11-21T09:38:19Z | |
| dc.date.available | 2024-11-21T09:38:19Z | |
| dc.date.issued | 2019 | |
| dc.identifier.citation | Vaidya, S. K., & Parmar, A. D. (2019). On chromatic transversal domination in graphs. Malaya Journal of Matematik, 7(03), 419-422. | en_US |
| dc.identifier.issn | 076-5131 | |
| dc.identifier.uri | http://10.9.150.37:8080/dspace//handle/atmiyauni/1877 | |
| 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 | Malaya Journal of Matematik | en_US |
| dc.subject | Neighborhood | en_US |
| dc.subject | Open Packing | en_US |
| dc.subject | Packing | en_US |
| dc.title | On chromatic transversal domination in graphs | en_US |
| dc.type | Article | en_US |
