Designs arising from products of hypergraphs of cycles
Künye
Huilgol, M. I. & Asok, S. (2025). Designs arising from products of hypergraphs of cycles. TWMS Journal of Applied and Engineering Mathematics, 15(5), 1123-1141.Özet
In this paper, we have considered many standard graph products viz. cartesian product, direct product, strong product and lexicographic product, and extended these graph products to hypergraphs which are natural generalizations of ususal graphs where edges may consist of more than two vertices. We have constructed a hypergraph of a graph by considering hyperedges as closed neighbourhood of each vertex in the graph. As the product of any two hypergraphs is again a hypergraph, we have obtained designs arising from products of hypergraphs where blocks are hyperedges of a hypergraph obtained by taking standard products of hypergraphs of cycles.
Cilt
15Sayı
5Bağlantı
https://jaem.isikun.edu.tr/web/index.php/current/131-vol15no5/1395http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/6734
Koleksiyonlar
Aşağıdaki lisans dosyası bu öğe ile ilişkilidir:
İlgili Öğeler
Başlık, yazar, küratör ve konuya göre gösterilen ilgili öğeler.
-
Measurement of planarity in product bipolar fuzzy graphs
Naz, Sumera; Ashraf, Samina; Rashmanlou, Hossein (Işık University Press, 2019)Bipolar fuzzy set theory provides a basis for bipolar cognitive modeling and multiagent decision analysis, where in some situations, the product operator may be preferred to the min operator, from theoretical and experimental ... -
K-product cordial labeling of fan graphs
Daisy, K. Jeya; Sabibha, R. Santrin; Jeyanthi, Pon; Youssef, Maged Z. (Işık University Press, 2023-01)Let f be a map from V (G) to {0, 1, ..., k ? 1} where k is an integer, 1 ? k ? |V (G)|. For each edge uv assign the label f(u)f(v)(mod k). f is called a k-product cordial labeling if |vf (i) ? vf (j)| ? 1, and |ef (i) ? ... -
Distance magic labeling for some product graphs
Shrimali, Narendra P.; Parmar, Yamini; Patel, Mahendra A. (Işık University Press, 2024-10)In this paper, we prove Wt □ G and Wt ⊠ G are not distance magic if graph G contains two vertices with the same neighborhood. And we also prove Wt × C4 (t ≥ 5), W3□Pn and W4 × Pn (n ≥ 3) are not distance magic graphs.