Generation of graphs using hyper-edge replacement graph rewriting P system
Künye
Vinodhini, K. & Sankar, M. P. (2024). Generation of graphs using hyper-edge replacement graph rewriting P system. TWMS Journal of Applied and Engineering Mathematics, 14(3), 1099-1108.Özet
Hyper-edge replacement graph grammar is considered a kernel in generating graphs and hypergraphs, and it has stood out enough to be noticed in recent years. George Paun proposed Membrane computing, frequently known as P system, as a bioinspired model or a model of natural computing. The field of Membrane computing is first roused by the manner in which nature processes at the cell levels. In this paper, using the hyper-edge replacement graph rewriting P system, significant graphs like Snail graphs, Caterpillar graphs, Comb graphs, Fire Cracker graphs, and Wheel graphs are generated with hyper-edge rules of minimum order.
Cilt
14Sayı
3Bağlantı
https://jaem.isikun.edu.tr/web/index.php/archive/125-vol14no3/1240http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/6075
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.
-
Balanced rank distribution labeling of ladder graphs, complete graphs and complete bipartite graphs
Hemalatha, Palanisamy; Gokilamani, S. (Işık University Press, 2021)A balanced rank distribution labeling of a graph G of order n is a new kind of vertex labeling from {1, 2, 3, ..., k}(n <= k is an element of Z(+)) which leads to a balanced edge labeling of G called edge ranks. In this ... -
Hub-integrity of splitting graph and duplication of graph elements
Mahde, Sultan Senan; Mathad, Veena (Işık University Press, 2016-01-08)The hub-integrity of a graph G = (V (G), E(G)) is denoted as HI(G) and defined by HI(G) = min{|S| + m(G ? S), S is a hub set of G}, where m(G ? S) is the order of a maximum component of G ? S. In this paper, we discuss ... -
Distance spectra of some graph operations and some new distance equienergetic graphs of diameter 3
Adiga, Chandrashekar; Rakshith, B. R.; Sumithra (Işık University Press, 2019)Two graphs of same order are said to be distance equienergetic if their distance energies are same. In this paper, we first give a partial insight on the distance spectrum of Mycielskian graphs and then we focus on ...