Tanmoy Mahapatra

Dr. Tanmoy Mahapatra

orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 April 2020 in Journal of Ambient Intelligence and Humanized Computing
Verified
Journal Article
Closed access
PDF file
TMTanmoy Mahapatra
Tanmoy Mahapatra
Ganesh GhoraiGanesh Ghorai
Ganesh Ghorai
MPMadhumangal Pal
Madhumangal Pal

2 August 2020 in Artificial Intelligence Review
Verified
Journal Article
Closed access
PDF file
TMTanmoy Mahapatra
Tanmoy Mahapatra
SSSankar Sahoo
Sankar Sahoo
Ganesh GhoraiGanesh Ghorai
Ganesh Ghorai
MPMadhumangal Pal
Madhumangal Pal

6 February 2021 in Journal of Ambient Intelligence and Humanized Computing
Verified
Journal Article
Closed access
PDF file
TMTanmoy Mahapatra
Tanmoy Mahapatra
MPMadhumangal Pal
Madhumangal Pal

4 December 2023 in IEEE Access
Verified
Journal Article
Open access
UMUttam Mondal
Uttam Mondal
TMTanmoy Mahapatra
Tanmoy Mahapatra
QXQin Xin
Qin Xin
MPMadhumangal Pal
Madhumangal Pal
Planarity of crisp graphs is a well-established field, whereas planarity within a fuzzy framework has seen recent development and extensive exploration. In an m -polar fuzzy graph ( m PFG), each node and edge is associated with m -components, connected through minimal relationships. However, if one desires to incorporate maximum, average, or other intermediate relationships between nodes and edges, the m PFG concept becomes inadequate as in the m -polar fuzzy model, only minimum relation is considered. To address this limitation, a generalized model of m PFG is introduced in this article, allowing for a broader range of relationships to be considered simultaneously. This paper also discusses the properties of generalized m -polar fuzzy environments and generalized m -polar fuzzy graphs (G m PFGs), highlighting their isomorphism. Several significant findings and insights are presented in this paper. The article delves into the properties and characteristics of generalized m -polar fuzzy planar graphs (G m PFPGs) and explores various intriguing aspects related to them. Additionally, a novel concept of a generalized m -polar fuzzy dual graph (G m PFDG) is introduced, derived from G m PFPGs. The paper establishes a relationship between the dual of a G m PFG and G m PFG, examining their properties in the context of dual G m PFPGs. Lastly, the article discusses an illustrative example of a social group network problem assessing the group’s activity based on attributes such as cooperation, team spirit, awareness, controlling power, good behaviour, and creativity.

14 March 2023 in Mathematics
Verified
Journal Article
Open access
PDF file
G. MuhiuddinG. Muhiuddin
G. Muhiuddin
TMTanmoy Mahapatra
Tanmoy Mahapatra
MPMadhumangal Pal
Madhumangal Pal
OAOhoud Alshahrani
Ohoud Alshahrani
AMAhsan Mahboob
Ahsan Mahboob
Integrity for crisp graph theory is a well-defined topic. However, the integrity concept for fuzzy graphs has only recently been defined and extensively researched. However, in m-polar fuzzy graphs (mPFG), each node as well as edges has m components. So, defining integrity in the mPF environment needs a new concept. As in the m-polar fuzzy environment, each node and edge has m components, so we have more flexibility to address the uncertainty rather than fuzzy as well as other uncertain environments. In this article, we developed a brand-new idea known as node integrity on mPFG and went in-depth on a few of their related properties. We have thoroughly covered some of their related properties as well as a brand-new idea called dominating integrity on mPFG. Different types of integrity on mPFG such as node integrity, dominating integrity, and edge integrity are discussed thoroughly along with some of its interesting facts have been introduced. Under isomorphism, their properties have also been studied. We also discussed the interrelation between them. A new type of mPFG called efficient mPFG which is directly related to dominating integrity concept has also been introduced. Several facts about efficient mPFG have also been studied here along with details descriptions. Finally, a real-world mobile network application that is directly related to the integrity of the mPFG concept has been discussed.

30 September 2023 in Mathematics
Verified
Journal Article
Open access
PDF file
AAAbdulaziz M. ALANAZI
Abdulaziz M. ALANAZI
G. MuhiuddinG. Muhiuddin
G. Muhiuddin
BABashair M. Alenazi
Bashair M. Alenazi
TMTanmoy Mahapatra
Tanmoy Mahapatra
MPMadhumangal Pal
Madhumangal Pal
It is well known that crisp graph theory is saturated. However, saturation in a fuzzy environment has only lately been created and extensively researched. It is necessary to consider m components for each node and edge in an m-polar fuzzy graph. Since there is only one component for this idea, we are unable to manage this kind of circumstance using the fuzzy model since we take into account m components for each node as well as edges. Again, since each edge or node only has two components, we are unable to apply a bipolar or intuitionistic fuzzy graph model. In contrast to other fuzzy models, mPFG models produce outcomes of fuzziness that are more effective. Additionally, we develop and analyze these kinds of mPFGs using examples and related theorems. Considering all those things together, we define saturation for a m-polar fuzzy graph (mPFG) with multiple membership values for both vertices and edges; thus, a novel approach is required. In this context, we present a novel method for defining saturation in mPFG involving m saturations for each element in the membership value array of a vertex. This explains α-saturation and β-saturation. We investigate intriguing properties such as α-vertex count and β-vertex count and establish upper bounds for particular instances of mPFGs. Using the concept of α-saturation and α-saturation, block and bridge of mPFG are characterized. To identify the α-saturation and β-saturation mPFGs, two algorithms are designed and, using these algorithms, the saturated mPFG is determined. The time complexity of these algorithms is O(|V|3), where |V| is the number of vertices of the given graph. In addition, we demonstrate a practical application where the concept of saturation in mPFG is applicable. In this application, an appropriate location is determined for the allocation of a facility point.