Splicing Operation on Graphs
In this paper, we introduce the splicing operation on graph P system with the feature of conditional communication. We use the notions of Fruend graph splicing and generate the string graph languages. We study the generative power of the splicing graph P system with conditional communication with th...
Gespeichert in:
| Veröffentlicht in: | International journal of computer applications 2012-01, Vol.49 (8), p.18-22 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 22 |
|---|---|
| container_issue | 8 |
| container_start_page | 18 |
| container_title | International journal of computer applications |
| container_volume | 49 |
| creator | Sankar, Meena Parvathy David, N Gnanamalar Thomas, D Gnanaraj |
| description | In this paper, we introduce the splicing operation on graph P system with the feature of conditional communication. We use the notions of Fruend graph splicing and generate the string graph languages. We study the generative power of the splicing graph P system with conditional communication with the other classes of string graph languages and give comparison results of the languages generated by the system. |
| doi_str_mv | 10.5120/7646-0733 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1283721219</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1283721219</sourcerecordid><originalsourceid>FETCH-LOGICAL-c1303-d70ca4eb1ce56606f410ce605d93880b806759421cdf760178877d9e15699c4e3</originalsourceid><addsrcrecordid>eNpdkD1LA0EQhhdRMCQp7C0CNlpcnNnvLSVoFAIp1HrZ7O3phcvduZsr_PfuEQtxGJi3eBheHkKuEJYCKdwryWUBirEzMgGjRKG1Vud_8iWZp7SHPMxQafiEXL_2Te3r9mOx7UN0x7prF3nX0fWfaUYuKtekMP-9U_L-9Pi2ei422_XL6mFTeGTAilKBdzzs0AchJciKI_ggQZSGaQ07DVIJwyn6slISUOUmqjQBhTTG88Cm5Pb0t4_d1xDS0R7q5EPTuDZ0Q7JINVMUKZqM3vxD990Q29wuU0whk2h4pu5OlI9dSjFUto_1wcVvi2BHVXZUZUdV7AdHrFZf</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1237136194</pqid></control><display><type>article</type><title>Splicing Operation on Graphs</title><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><creator>Sankar, Meena Parvathy ; David, N Gnanamalar ; Thomas, D Gnanaraj</creator><creatorcontrib>Sankar, Meena Parvathy ; David, N Gnanamalar ; Thomas, D Gnanaraj</creatorcontrib><description>In this paper, we introduce the splicing operation on graph P system with the feature of conditional communication. We use the notions of Fruend graph splicing and generate the string graph languages. We study the generative power of the splicing graph P system with conditional communication with the other classes of string graph languages and give comparison results of the languages generated by the system.</description><identifier>ISSN: 0975-8887</identifier><identifier>EISSN: 0975-8887</identifier><identifier>DOI: 10.5120/7646-0733</identifier><language>eng</language><publisher>New York: Foundation of Computer Science</publisher><subject>Communication systems ; Graphs ; Splicing ; Strings</subject><ispartof>International journal of computer applications, 2012-01, Vol.49 (8), p.18-22</ispartof><rights>Copyright Foundation of Computer Science 2012</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids></links><search><creatorcontrib>Sankar, Meena Parvathy</creatorcontrib><creatorcontrib>David, N Gnanamalar</creatorcontrib><creatorcontrib>Thomas, D Gnanaraj</creatorcontrib><title>Splicing Operation on Graphs</title><title>International journal of computer applications</title><description>In this paper, we introduce the splicing operation on graph P system with the feature of conditional communication. We use the notions of Fruend graph splicing and generate the string graph languages. We study the generative power of the splicing graph P system with conditional communication with the other classes of string graph languages and give comparison results of the languages generated by the system.</description><subject>Communication systems</subject><subject>Graphs</subject><subject>Splicing</subject><subject>Strings</subject><issn>0975-8887</issn><issn>0975-8887</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2012</creationdate><recordtype>article</recordtype><recordid>eNpdkD1LA0EQhhdRMCQp7C0CNlpcnNnvLSVoFAIp1HrZ7O3phcvduZsr_PfuEQtxGJi3eBheHkKuEJYCKdwryWUBirEzMgGjRKG1Vud_8iWZp7SHPMxQafiEXL_2Te3r9mOx7UN0x7prF3nX0fWfaUYuKtekMP-9U_L-9Pi2ei422_XL6mFTeGTAilKBdzzs0AchJciKI_ggQZSGaQ07DVIJwyn6slISUOUmqjQBhTTG88Cm5Pb0t4_d1xDS0R7q5EPTuDZ0Q7JINVMUKZqM3vxD990Q29wuU0whk2h4pu5OlI9dSjFUto_1wcVvi2BHVXZUZUdV7AdHrFZf</recordid><startdate>20120101</startdate><enddate>20120101</enddate><creator>Sankar, Meena Parvathy</creator><creator>David, N Gnanamalar</creator><creator>Thomas, D Gnanaraj</creator><general>Foundation of Computer Science</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20120101</creationdate><title>Splicing Operation on Graphs</title><author>Sankar, Meena Parvathy ; David, N Gnanamalar ; Thomas, D Gnanaraj</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c1303-d70ca4eb1ce56606f410ce605d93880b806759421cdf760178877d9e15699c4e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Communication systems</topic><topic>Graphs</topic><topic>Splicing</topic><topic>Strings</topic><toplevel>online_resources</toplevel><creatorcontrib>Sankar, Meena Parvathy</creatorcontrib><creatorcontrib>David, N Gnanamalar</creatorcontrib><creatorcontrib>Thomas, D Gnanaraj</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>International journal of computer applications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Sankar, Meena Parvathy</au><au>David, N Gnanamalar</au><au>Thomas, D Gnanaraj</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Splicing Operation on Graphs</atitle><jtitle>International journal of computer applications</jtitle><date>2012-01-01</date><risdate>2012</risdate><volume>49</volume><issue>8</issue><spage>18</spage><epage>22</epage><pages>18-22</pages><issn>0975-8887</issn><eissn>0975-8887</eissn><abstract>In this paper, we introduce the splicing operation on graph P system with the feature of conditional communication. We use the notions of Fruend graph splicing and generate the string graph languages. We study the generative power of the splicing graph P system with conditional communication with the other classes of string graph languages and give comparison results of the languages generated by the system.</abstract><cop>New York</cop><pub>Foundation of Computer Science</pub><doi>10.5120/7646-0733</doi><tpages>5</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0975-8887 |
| ispartof | International journal of computer applications, 2012-01, Vol.49 (8), p.18-22 |
| issn | 0975-8887 0975-8887 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1283721219 |
| source | Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals |
| subjects | Communication systems Graphs Splicing Strings |
| title | Splicing Operation on Graphs |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-06T04%3A48%3A54IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Splicing%20Operation%20on%20Graphs&rft.jtitle=International%20journal%20of%20computer%20applications&rft.au=Sankar,%20Meena%20Parvathy&rft.date=2012-01-01&rft.volume=49&rft.issue=8&rft.spage=18&rft.epage=22&rft.pages=18-22&rft.issn=0975-8887&rft.eissn=0975-8887&rft_id=info:doi/10.5120/7646-0733&rft_dat=%3Cproquest_cross%3E1283721219%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1237136194&rft_id=info:pmid/&rfr_iscdi=true |