Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Lisa Mathew"'
Publikováno v:
Symmetry, Vol 15, Iss 2, p 349 (2023)
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 circuit
Externí odkaz:
https://doaj.org/article/08abeb0ee58c4bacad1e1f1c727913be
Publikováno v:
Journal of Mathematics, Vol 2021 (2021)
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 to
Externí odkaz:
https://doaj.org/article/48f27caa0fb34a1d9e7a1107c0e90d2e
Publikováno v:
Gastroenterology. 164:847-850
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5382a09d1a8eb51871c4218daff0238d
https://doi.org/10.1053/j.gastro.2023.01.042
https://doi.org/10.1053/j.gastro.2023.01.042
Date palm (Phoenix dactylifera) fruit are an economically and culturally significant crop in the Middle East and North Africa. There are hundreds of different commercial cultivars producing dates with distinctive shapes, colors, and sizes. Genetic st
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c7258174f7e3f6721128efc4bfaa1a0c
https://doi.org/10.22541/essoar.167338521.19491384/v1
https://doi.org/10.22541/essoar.167338521.19491384/v1
Publikováno v:
Ars Mathematica Contemporanea. 20:243-260
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a2f5c4a337baf0c4631de3b14a392715
https://doi.org/10.26493/1855-3974.2359.a7b
https://doi.org/10.26493/1855-3974.2359.a7b
Publikováno v:
Journal of Mathematics, Vol 2021 (2021)
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 to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cddf14bdd6e0fca1467f200924c5b54c
https://doi.org/10.1155/2021/5567663
https://doi.org/10.1155/2021/5567663
Publikováno v:
International Journal of Research in Pharmaceutical Sciences. 10:3204-3208
Use of intravenous heparin in Acute coronary syndrome possess a major risk of bleeding to patients. However, the estimation of risk using bleeding scores in Indian settings is yet to be established. These case series assess the risk of major bleeding
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5b5322b239d1deaa10b8ab377e4b59ec
https://doi.org/10.26452/ijrps.v10i4.1623
https://doi.org/10.26452/ijrps.v10i4.1623
Publikováno v:
Advances in Applied Mathematics. 107:102-115
Consequent to the introduction of the concept of Parikh matrix of a word which is based on the notion of subwords of a word, there has been an extensive research and study based on subwords. Parikh word representable graph is one such notion which ha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::61563c4828a20b66d59c31cd37db744c
https://doi.org/10.1016/j.aam.2019.02.009
https://doi.org/10.1016/j.aam.2019.02.009
Publikováno v:
2021 International Conference on Innovative Trends in Information Technology (ICITIIT).
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 $
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b078e12709667081ce40ec0b1ca3d83b
https://doi.org/10.1109/icitiit51526.2021.9399604
https://doi.org/10.1109/icitiit51526.2021.9399604
Publikováno v:
Developments in Language Theory ISBN: 9783030815073
DLT
DLT
Study on numerical properties of words based on scattered subwords of words was initiated around the year 2000, introducing certain upper triangular matrices, called Parikh matrices. On the other hand, linking the areas of combinatorics on words and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fd041d3097ac5e19380ffe71c86538d4
https://doi.org/10.1007/978-3-030-81508-0_30
https://doi.org/10.1007/978-3-030-81508-0_30