Zobrazeno 1 - 10
of 59
pro vyhledávání: '"Kalpana Mahalingam"'
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 18, Iss 1, Pp 7-15 (2021)
We introduce new labeling called m-bonacci graceful labeling. A graph G on n edges is m-bonacci graceful if the vertices can be labeled with distinct integers from the set such that the derived edge labels are the first n m-bonacci numbers. We show t
Externí odkaz:
https://doaj.org/article/499bfee6ac5f40a1a537d7216e383090
Publikováno v:
Discrete Applied Mathematics. 334:127-138
The block reversal of a word $w$, denoted by $\mathtt{BR}(w)$, is a generalization of the concept of the reversal of a word, obtained by concatenating the blocks of the word in the reverse order. We characterize non-binary and binary words whose bloc
Publikováno v:
Discrete Applied Mathematics. 319:149-158
We introduce the notion of m -bonacci-sum graphs denoted by G m , n for positive integers m , n . The vertices of G m , n are 1 , 2 , … , n and any two vertices are adjacent if and only if their sum is an m -bonacci number. We show that G m , n is
Publikováno v:
Synergies in Analysis, Discrete Mathematics, Soft Computing and Modelling ISBN: 9789811970139
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::48a3866ec122b82383f655b213b9bd32
https://doi.org/10.1007/978-981-19-7014-6_10
https://doi.org/10.1007/978-981-19-7014-6_10
Autor:
Kalpana Mahalingam, Palak Pandoh
Publikováno v:
International Journal of Foundations of Computer Science. 33:389-409
A two-dimensional (2D) word is a 2D palindrome if it is equal to its reverse and it is an HV-palindrome if all its columns and rows are 1D palindromes. We characterize such words and study some of their combinatorial and structural properties. We als
Publikováno v:
Theoretical Computer Science. 894:135-151
The block reversal of a word is a generalization of the concept of reversal of a word where in place of reversing individual letters, we take the blocks of the word in the reverse order. Since there can be multiple ways in which a word can be divided
Autor:
ANURAN MAITY, Kalpana Mahalingam
This paper is a theoretical study of notions in combinatorics of words motivated by information being encoded as DNA strands in DNA computing. We study Watson-Crick conjugates or \theta-conjugates, a generalization of the classical notions of conjuga
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c7d7c033c07eef8d770accfb89c0b1de
http://arxiv.org/abs/2208.03123
http://arxiv.org/abs/2208.03123
Publikováno v:
The Computer Journal. 65:1178-1188
A new model of computation called Watson–Crick jumping finite automata was introduced by Mahalingam et al., and the authors study the computing power and closure properties of the variants of the model. There are four variants of the model: no stat
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 18, Iss 1, Pp 7-15 (2021)
We introduce new labeling called m-bonacci graceful labeling. A graph G on n edges is m-bonacci graceful if the vertices can be labeled with distinct integers from the set such that the derived edge labels are the first n m-bonacci numbers. We show t
Publikováno v:
International Journal of Foundations of Computer Science. 31:891-913
Watson–Crick jumping finite automata work on tapes which are double stranded sequences of symbols similar to that of Watson–Crick automata. The double stranded sequence is scanned in a discontinuous manner. That is, after reading a double strande