Generation of Specialized Graph Classes Using Hyper-edge Replacement P System.
Saved in:
| Title: | Generation of Specialized Graph Classes Using Hyper-edge Replacement P System. |
|---|---|
| Authors: | Krishnamoorthy, Vinodhini1 vk8271@srmist.edu.in, Sankar, Meena Parvathy2 meenap@srmist.edu.in |
| Source: | IAENG International Journal of Applied Mathematics. Nov2024, Vol. 54 Issue 11, p2209-2217. 9p. |
| Subjects: | Graph grammars, Biological systems, Hypergraphs, Tadpoles, Sunflowers |
| Abstract: | Graphs serve as flexible representations for capturing relationships between entities, while graph grammar offers a rule-based framework for transforming and generating graphs. In recent years, hyper-edge replacement graph grammar has emerged as a significant tool for generating both graphs and hypergraphs. George Paun introduced membrane computing, also known as the P system, as a computational paradigm that draws inspiration from biological systems. The intricate processes observed at the cellular level initially inspired the development of membrane computing. In this study, we leverage the ability of the hyper-edge replacement graph rewriting P system to generate new graphs using minimal-order hyper-edge rules, resulting in a large collection of graphs. Our primary objective is to produce cycle, tree, wheel, and broom graphs, as well as graphs that demonstrate resemblances to cycle, tree, and wheel graphs. This entails the generation of a multitude of graph types, including pan, prism, sunlet, tadpole, web, binary, ternary, k-ary trees, gear, helm, flower, and sunflower. [ABSTRACT FROM AUTHOR] |
| Copyright of IAENG International Journal of Applied Mathematics is the property of International Association of Engineers (IAENG) and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| Abstract: | Graphs serve as flexible representations for capturing relationships between entities, while graph grammar offers a rule-based framework for transforming and generating graphs. In recent years, hyper-edge replacement graph grammar has emerged as a significant tool for generating both graphs and hypergraphs. George Paun introduced membrane computing, also known as the P system, as a computational paradigm that draws inspiration from biological systems. The intricate processes observed at the cellular level initially inspired the development of membrane computing. In this study, we leverage the ability of the hyper-edge replacement graph rewriting P system to generate new graphs using minimal-order hyper-edge rules, resulting in a large collection of graphs. Our primary objective is to produce cycle, tree, wheel, and broom graphs, as well as graphs that demonstrate resemblances to cycle, tree, and wheel graphs. This entails the generation of a multitude of graph types, including pan, prism, sunlet, tadpole, web, binary, ternary, k-ary trees, gear, helm, flower, and sunflower. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 19929978 |
