Please use this identifier to cite or link to this item: http://10.9.150.37:8080/dspace//handle/atmiyauni/1985
Title: On chromatic transversal domination in graphs
Authors: Vaidya, S. K
Parmar, A. D.
Keywords: Neighborhood
Packing
Open Packing
Issue Date: 2019
Publisher: Malaya Journal of Matematik
Citation: Vaidya, S. K., & Parmar, A. D. (2019). On chromatic transversal domination in graphs. Malaya Journal of Matematik, 7(03), 419-422.
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.
URI: http://10.9.150.37:8080/dspace//handle/atmiyauni/1985
ISSN: 076-5131
Appears in Collections:01. Journal Articles

Files in This Item:
File Description SizeFormat 
On chromatic transversal domination in graphs.pdf1.77 MBAdobe PDFView/Open
Show full item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.