Lisa Mathew
@amaljyothi.ac.in
Scopus Publications
Scholar Citations
Scholar h-index
Scholar i10-index
Scopus Publications
Jayakrishna Vijayakumar, Lisa Mathew, and Atulya K. Nagar
MDPI AG
Graph grammars can be used to model the development of diverse graph families. Since their creation in the late 1960s, graph grammars have found usage in a variety of fields, such as the design of sophisticated computer systems and electronic circuits, as well as visual languages, computer animation, and even the modelling of intricate molecular structures Replacement of edges and nodes are the two primary approaches of graph rewriting. In this paper we introduce a new type of node replacement graph grammar known as nc-eNCE graph grammar. With this new class of graph grammars we generated certain graph classes and we showed that these class of graph grammars are more powerful than the existing edge and node controlled embedding graph grammars. In addition, these graph grammars were used to model several common protein secondary structures such as parallel and anti-parallel β-sheet structures in different configurations. The use of these graph grammars in modelling other bio-chemical structures and their interactions remains to be explored.
V. Jayakrishna, Lisa Mathew, Nobin Thomas, K.G. Subramanian, and Juby Mathew
IEEE
Graph grammars are capable of modelling the generation of various families of graphs. Graph rewriting has basically two different approaches namely, node replacement and edge replacement rewriting. A variant of node replacement graph grammar called $nc-eNCE$ graph grammars was introduced recently. Recently, a special kind of graph, called Parikh word representable graph was introduced and its properties were studied. The problem of generation of graph structures using graph grammars has been considered in many studies. Here we generate the Parikh word representable graphs using $nc-eNCE$ graph grammars.
Nobin Thomas, Lisa Mathew, Sastha Sriram, and K. G. Subramanian
University of Primorska Press
A new class of graphs G(w), called Parikh word representable graphs (PWRG), corresponding to words $w$ that are finite sequence of symbols, was considered in the recent past. Several properties of these graphs have been established. In this paper, we consider these graphs corresponding to binary core words of the form $aub$ over a binary alphabet {a,b}. We derive formulas for computing the Wiener index of the PWRG of a binary core word. Sharp bounds are established on the value of this index in terms of different parameters related to binary words over {a,b} and the corresponding PWRGs. Certain other Wiener-type indices that are variants of Wiener index are also considered. Formulas for computing these indices in the case of PWRG of a binary core word are obtained.
Nobin Thomas, Lisa Mathew, Somnath Bera, Atulya K. Nagar, and K. G. Subramanian
Springer International Publishing
Nobin Thomas, Lisa Mathew, Sastha Sriram, Atulya K. Nagar, and K. G. Subramanian
Hindawi Limited
Relating graph structures with words which are finite sequences of symbols, Parikh word representable graphs (PWRGs) were introduced. On the other hand, in chemical graph theory, graphs have been associated with molecular structures. Also, several topological indices have been defined in terms of graph parameters and studied for different classes of graphs. In this study, we derive expressions for computing certain topological indices of PWRGs of binary core words, thereby enriching the study of PWRGs.
Lisa Mathew, Nobin Thomas, Somnath Bera, and K.G. Subramanian
Elsevier BV
Susan Elias, Lisa Mathew, K. S. Easwarakumar, and Richard Chbeir
IEEE
An efficient authoring tool would provide support for automatic temporal formatting and modeling of multimedia presentations. Automatic temporal formatting is a process of converting the given presentation specifications into a required temporal format. This paper presents an algorithm that can convert a temporal layout into a dynamic petri net (DPN )w hich can represent iterative and interactive presentation components effectively. The prototype of the authoring tool extracts the temporal layout from any given SMIL file representation and uses the proposed algorithm to automatically convert it into a DPN. The DPN generated automatically at compile-time helps the run-time components in effectively playing out the presentation and it can also be used to verify the presentation specifications for several properties.
Susan Elias, Palaniappan V, K. S. Easwarakumar, Lisa Mathew, and Richard Chbeir
IEEE
In distributed multimedia presentation systems, a workflow is defined to specify which activities need to be executed and in which order. Workflows need to be modeled and verified for effective synchronisation during playout. To model several of these workflows, high-level petri nets have been commonly used. However, petri nets are not suitable for distributed applications and most of them are limited in their capability in modeling workflows having multiple instances with or without a priori runtime knowledge. In this paper, we address the modeling of complex workflow patterns and propose a new approach able to both represent complex distributed multimedia presentation using dynamic petri nets(DPNs) and to translate a verified set of specifications into the new deterministic programming language Orc. DPNs are programmable petri nets that can: efficiently model user interactions and synchronised iterative playouts, and ensure that they represent consistent presentations, while Orc allows providing easy implementations using a set of powerful constructs.
Rani Siromoney, Lisa Mathew, V.R. Dare, and K.G. Subramanian
Elsevier BV
K.G. Subramanian, Rani Siromoney, and Lisa Mathew
Elsevier BV
Rani Siromoney, Lisa Mathew, K. G. Subramanian, and V. Rajkumar Dare
Springer Berlin Heidelberg
Rani Siromoney and Lisa Mathew
Elsevier BV