آمار

تعداد نشریات31
تعداد شماره‌ها489
تعداد مقالات4,365
تعداد مشاهده مقاله7,477,534
تعداد دریافت فایل اصل مقاله5,035,478
F. Pawar, Kishor, M. Jadhav, Megha. (1400). On edge product hypergraphs. سامانه مدیریت نشریات علمی, 10(1), 1-12. doi: 10.22098/jhs.2021.2636
Kishor F. Pawar; Megha M. Jadhav. "On edge product hypergraphs". سامانه مدیریت نشریات علمی, 10, 1, 1400, 1-12. doi: 10.22098/jhs.2021.2636
F. Pawar, Kishor, M. Jadhav, Megha. (1400). 'On edge product hypergraphs', سامانه مدیریت نشریات علمی, 10(1), pp. 1-12. doi: 10.22098/jhs.2021.2636
F. Pawar, Kishor, M. Jadhav, Megha. On edge product hypergraphs. سامانه مدیریت نشریات علمی, 1400; 10(1): 1-12. doi: 10.22098/jhs.2021.2636

On edge product hypergraphs

Journal of Hyperstructures
دوره 10، شماره 1، شهریور 2021، صفحه 1-12    اصل مقاله (335.51 K)
نوع مقاله: Research Paper
شناسه دیجیتال (DOI): 10.22098/jhs.2021.2636
نویسندگان
Kishor F. Pawar* 1؛ Megha M. Jadhav2
1Department of Mathematics, School of Mathematical Sciences, Kavayitri Bahinabai Chaudhari North Maharashtra University, Jalgaon, 425 001, India
2Department of Mathematics, School of Mathematical Sciences, Kavayitri Bahinabai Chaudhari North Maharashtra University Jalgaon-425 001, India
چکیده
In this paper we introduced the notion of an edge product hypergraph. A hypergraph H is said to be an edge product
hypergraph if edges of hypergraph can be labeled with distinct positive integers such that the product of all the labels of edges incident to a vertex is again an edge label of H and if the product of any collection of edges is a label of an edge in H then, they are incident to a vertex. Here we have proved some important results by which one can verify that given hypergraph is a unit edge product hypergraph or not. We also found some results on domination number and inverse domination number of edge product hypergraph and its complement. 
کلیدواژه‌ها
edge product hypergraph؛ unit edge product hypergraph؛ domination number
مراجع
[1] C. Berge, Graphs and Hypergraphs, North-Holland, Amsterdam, 1973.
[2] C. Berge, Hypergraphs, Combinatorics of Finite Sets, North-Holland, Amsterdam, 1989.
[3] Bibin K. Jose, Zs. Tuza, Hypergraph Domination and Strong Independence, Appl. Anal. Discrete Math., 3 (2009), 347-358.
[4] Gallian Joseph A, A dynamic survey of graph labelling, Electronic J. Combin., 16 (2000), 39{48.
[5] F. Harary, Sum graphs and di erence graphs, Congress. Numer., 72 (1990), 101-108.
[6] A. Rosa, On certain valuations of the vertices of a graph, Theory of Graphs Inter Nat. Symposium, Rome, July 1966, Gordon and N.Y.Breach and Dunod, Paris, (1988) 349-355.
[7] Thavamani J. P. and Ramesh D.S.T., Edge product graphs and its properties, The IUP Journal of Computational Mathematics, 4 (2011), 30-38.

آمار
تعداد مشاهده مقاله: 276
تعداد دریافت فایل اصل مقاله: 432


سامانه مدیریت نشریات علمی. قدرت گرفته از سیناوب