Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Shaik, Sharief Basha"'
In this article, a new hesitancy fuzzy similarity measure is defined and then used to develop the matrix of hesitancy fuzzy similarity measures, which is subsequently used to classify hesitancy fuzzy graph using the working procedure. We build a work
Externí odkaz:
http://arxiv.org/abs/2205.00880
Autor:
Nallapareddy, Rajagopal Reddy1, Shaik, Sharief Basha2 shariefbasha.s@vit.ac.in
Publikováno v:
International Journal of Industrial Engineering. 2024, Vol. 31 Issue 3, p524-541. 18p.
Autor:
Thandra Jithendra, Shaik Sharief Basha
Publikováno v:
Diagnostics, Vol 13, Iss 9, p 1641 (2023)
This research is aimed to escalate Adaptive Neuro-Fuzzy Inference System (ANFIS) functioning in order to ensure the veracity of existing time-series modeling. The COVID-19 pandemic has been a global threat for the past three years. Therefore, advance
Externí odkaz:
https://doaj.org/article/6fe0bd16a72a44d88d9d9fb8d8978b63
Publikováno v:
COMPUTING AND INFORMATICS; Vol. 42 No. 2 (2023): Computing and Informatics; 436–456
Intuitionistic fuzzy graphs are extensions of fuzzy graphs that preserve the dualism characteristics of fuzzy graphs and have a stronger capacity to describe ambiguity in actual decision-making issues than fuzzy graphs. In this research paper, the La
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=issn13359150::905d1605a207be44019331c1c7abf375
https://www.cai.sk/ojs/index.php/cai/article/view/2023_2_436
https://www.cai.sk/ojs/index.php/cai/article/view/2023_2_436
Autor:
Shaik Sharief Basha
Publikováno v:
International Journal of Computing Science and Mathematics. 9:515
A reverse magic labelling of a graph G(V, E) is a bijection f: V ∪ E → {1, 2, 3, ......, v + e} such that for all edges xy, f(xy) - {f(x) + f(y)} is a constant which is denoted by c(f). A reverse magic labelling of a graph G(V, E) is called rever
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d8bdd7dc89b798d6c718139eca99f4ff
https://doi.org/10.1504/ijcsm.2018.095503
https://doi.org/10.1504/ijcsm.2018.095503
Publikováno v:
Research Journal of Pharmacy and Technology. 9:1710
A reverse vertex magic labeling of a graph G = (V,E) is a bijection such that for every vertex , is a constant . It is well known that all complete graphs Kn admit a reverse magic labeling. In this paper, we present a new proof of this theorem using
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ac709aa0d349664a0dad3a84d88dcdff
https://doi.org/10.5958/0974-360x.2016.00345.0
https://doi.org/10.5958/0974-360x.2016.00345.0