CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Splicing Operation on Graphs

by Meena Parvathy Sankar, N. Gnanamalar David, D. Gnanaraj Thomas
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 49 - Number 8
Year of Publication: 2012
Authors: Meena Parvathy Sankar, N. Gnanamalar David, D. Gnanaraj Thomas
10.5120/7646-0733

Meena Parvathy Sankar, N. Gnanamalar David, D. Gnanaraj Thomas . Splicing Operation on Graphs. International Journal of Computer Applications. 49, 8 ( July 2012), 18-22. DOI=10.5120/7646-0733

@article{ 10.5120/7646-0733,
author = { Meena Parvathy Sankar, N. Gnanamalar David, D. Gnanaraj Thomas },
title = { Splicing Operation on Graphs },
journal = { International Journal of Computer Applications },
issue_date = { July 2012 },
volume = { 49 },
number = { 8 },
month = { July },
year = { 2012 },
issn = { 0975-8887 },
pages = { 18-22 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume49/number8/7646-0733/ },
doi = { 10.5120/7646-0733 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:45:43.825751+05:30
%A Meena Parvathy Sankar
%A N. Gnanamalar David
%A D. Gnanaraj Thomas
%T Splicing Operation on Graphs
%J International Journal of Computer Applications
%@ 0975-8887
%V 49
%N 8
%P 18-22
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
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.

References
  1. P. Bottoni, A. Labella, C. Martin-Vide and Gh. Paun, "Rewriting P systems with conditional communication", Lecture Notes in Computer Science, 2300 (2002), pp. 352-353.
  2. R Freund, "Splicing systems on graphs", in : proceedings of Intelligence in neural and Biological Systems, IEEE Press, New York, May 1995, pp 189-194.
  3. C. Martin-vide and Gh. Paun, "Computing with membranes (P systems): Universality results", Lecture notes in computer science, 2055 (2001) pp. 82-101.
  4. G. Paun, "A guide to membrane computing", Theoritical computer science, vol 287 (2002), 73-100.
  5. G. Paun, "Computing with membranes", Journal of computer and system sciences, 61(2000), pp 108-143.
  6. Rahul Santhanam, Kamala Krithivasan, "Graph splicing systems", Discrete applied mathematics, 154(2006) 1264-1278.
Index Terms

Computer Science
Information Sciences

Keywords

Graph splicing Conditional communication Splicing graph P system

Powered by PhDFocusTM