Zobrazeno 1 - 10
of 45
pro vyhledávání: '"J. Baskar Babujee"'
Autor:
N. Shanthini, J. Baskar Babujee
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 3, Pp 892-898 (2020)
The crossing number of a graph G, Cr(G) is the minimum number of edge crossings overall good drawings of G. Among the well-known four standard graph products namely Cartesian product, Kronecker product, strong product and lexicographic product, the o
Externí odkaz:
https://doaj.org/article/c119fef1402a4692b8519cfc6bacc0b9
Autor:
J. Baskar BABUJEE, L. SHOBANA
Publikováno v:
Journal of Applied Computer Science & Mathematics, Vol 6, Iss 13, Pp 9-12 (2012)
The concept of cordial labeling in graphs motivated us to introduce cordial words, cordial languages and cordial numbers. We interpret the notion of cordial labeling in Automata and thereby study the corresponding languages. In this paper we develop
Externí odkaz:
https://doaj.org/article/4d6bfdb109714f2b8a4ca84d79082c98
Autor:
Mohammed Ali Ahmed, Andrea Semaničová-Feňovčíková, Martin Bača, J. Baskar Babujee, Loganathan Shobana
Publikováno v:
Aequationes mathematicae. 97:13-30
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fcddae44c3462bba8ef6c098c15fc68d
https://doi.org/10.1007/s00010-022-00930-1
https://doi.org/10.1007/s00010-022-00930-1
Publikováno v:
Advances and Applications in Discrete Mathematics. 35:45-59
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bd7ef2f205f16a095a2a868d47e83c67
https://doi.org/10.17654/0974165822051
https://doi.org/10.17654/0974165822051
Publikováno v:
Mathematical Notes. 111:297-304
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d61bd1e1f4b9f84c4f35aeadb3647698
https://doi.org/10.1134/s0001434622010333
https://doi.org/10.1134/s0001434622010333
Autor:
J. Baskar Babujee, N. Shanthini
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 3, Pp 892-898 (2020)
The crossing number of a graph G, Cr(G) is the minimum number of edge crossings overall good drawings of G. Among the well-known four standard graph products namely Cartesian product, Kronecker product, strong product and lexicographic product, the o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::40e7be10909470121cefd32d19c5d781
https://doaj.org/article/c119fef1402a4692b8519cfc6bacc0b9
https://doaj.org/article/c119fef1402a4692b8519cfc6bacc0b9
Autor:
J. Baskar Babujee, Mohammed Ali Ahmed
Publikováno v:
International Mathematical Forum. 12:151-158
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6f84f7972404573319b47e1ae930701b
https://doi.org/10.12988/imf.2017.612167
https://doi.org/10.12988/imf.2017.612167
Autor:
Mohammed Ali Ahmed, J. Baskar Babujee
Publikováno v:
Applied Mathematical Sciences. 11:77-91
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1604720ee8232f15d39b19ab36be092a
https://doi.org/10.12988/ams.2017.610262
https://doi.org/10.12988/ams.2017.610262
Autor:
J. Baskar Babujee, S. Ramakrishnan
Publikováno v:
Journal of Computational and Theoretical Nanoscience. 12:5449-5456
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::68d3b7268f55e9e68785060855faeb89
https://doi.org/10.1166/jctn.2015.4545
https://doi.org/10.1166/jctn.2015.4545
Publikováno v:
Theoretical Computer Science and Discrete Mathematics ISBN: 9783319644189
ICTCSDM
ICTCSDM
In formal language theory, the Siromoney matrix grammars generate matrix languages. They are two dimensional languages which are \(m \times n\) arrays of terminals. In string languages, the ability of a regular language to dissect an infinite languag
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bfce48d4d76c4d4f2428d79ad6901195
https://doi.org/10.1007/978-3-319-64419-6_13
https://doi.org/10.1007/978-3-319-64419-6_13
