Pub Date : 2021-02-28DOI: 10.37622/gjpam/17.1.2021.79-88
Ravinder Kumar, Y. Singh
{"title":"Harmless Delay in Mutualist, Prey and Several Predators Systems","authors":"Ravinder Kumar, Y. Singh","doi":"10.37622/gjpam/17.1.2021.79-88","DOIUrl":"https://doi.org/10.37622/gjpam/17.1.2021.79-88","url":null,"abstract":"","PeriodicalId":198465,"journal":{"name":"Global Journal of Pure and Applied Mathematics","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124777161","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-12-30DOI: 10.37622/gjpam/16.6.2020.939-946
Kedar Chandra Parida, D. Mohanty, N. Kalia
Research in mathematics and computer science has progressed in a widespread way to introduce new theories as efficacious model for plowing the difficulties of growing knowledge and information in varied sphere of real life. Soft set and rough set theory have been amalgamated by researchers as soft rough set to address the problems of imprecision and uncertainty . Soft Rough set nicely deals the complex issue of impreciseness and vagueness of information. This paper is brilliant attempt proposing soft rough set with covering as a new model to grapple the incipient matter of imprecision more easily presenting definition in varied manners with the help of two approximation operators.
{"title":"Soft Rough Set With Covering Based","authors":"Kedar Chandra Parida, D. Mohanty, N. Kalia","doi":"10.37622/gjpam/16.6.2020.939-946","DOIUrl":"https://doi.org/10.37622/gjpam/16.6.2020.939-946","url":null,"abstract":"Research in mathematics and computer science has progressed in a widespread way to introduce new theories as efficacious model for plowing the difficulties of growing knowledge and information in varied sphere of real life. Soft set and rough set theory have been amalgamated by researchers as soft rough set to address the problems of imprecision and uncertainty . Soft Rough set nicely deals the complex issue of impreciseness and vagueness of information. This paper is brilliant attempt proposing soft rough set with covering as a new model to grapple the incipient matter of imprecision more easily presenting definition in varied manners with the help of two approximation operators.","PeriodicalId":198465,"journal":{"name":"Global Journal of Pure and Applied Mathematics","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133541756","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-12-22DOI: 10.37622/gjpam/16.6.2020.871-889
A. Chaudhary, Vijay Kumar
{"title":"A Study on Properties and Goodness-of-Fit of the Logistic Inverse Weibull Distribution","authors":"A. Chaudhary, Vijay Kumar","doi":"10.37622/gjpam/16.6.2020.871-889","DOIUrl":"https://doi.org/10.37622/gjpam/16.6.2020.871-889","url":null,"abstract":"","PeriodicalId":198465,"journal":{"name":"Global Journal of Pure and Applied Mathematics","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115568858","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-06-30DOI: 10.37622/gjpam/16.6.2020.783-788
Jadunath Nayak, S. Acharya
{"title":"Dealing with a Transportation Problem with Multi Choice Cost Coefficients and Fuzzy Supplies and Demands","authors":"Jadunath Nayak, S. Acharya","doi":"10.37622/gjpam/16.6.2020.783-788","DOIUrl":"https://doi.org/10.37622/gjpam/16.6.2020.783-788","url":null,"abstract":"","PeriodicalId":198465,"journal":{"name":"Global Journal of Pure and Applied Mathematics","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116854944","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-04-30DOI: 10.37622/gjpam/16.2.2020.305-324
B. Sai
In this paper we present some of the main developments in the Applications of soft set theory as a survey of literature motivated by Molodtsov.
在本文中，我们提出了软集理论应用的一些主要发展，作为对莫洛佐夫推动的文献的调查。
{"title":"Applications of Soft Set in Decision Making Problems","authors":"B. Sai","doi":"10.37622/gjpam/16.2.2020.305-324","DOIUrl":"https://doi.org/10.37622/gjpam/16.2.2020.305-324","url":null,"abstract":"In this paper we present some of the main developments in the Applications of soft set theory as a survey of literature motivated by Molodtsov.","PeriodicalId":198465,"journal":{"name":"Global Journal of Pure and Applied Mathematics","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132676097","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-08-30DOI: 10.37622/gjpam/15.4.2019.499-504
K. Sowndarya, Y. Naidu
The proper coloring of a graph G is said to be a dominator coloring if each vertex of the graph dominates every vertex of some color class. The minimum number of color classes required to satisfy the condition of dominator coloring is said to be dominator chromatic number which is denoted by χd(G). Total dominator coloring is defined to be a proper coloring of G with a property that every vertex of G dominates all the vertices of at least one color class (other than the class itself). The minimum number of color classes required to satisfy the condition of total dominator coloring is called total dominator chromatic number and is denoted by χtd(G). In this paper, we would discuss the dominator and total dominator coloring parameters of bishops and rooks on square chessboard and give the values for dominator chromatic number and total dominator chromatic number for these chessboard graphs.
{"title":"Dominator and Total Dominator Coloring on Square Chessboard","authors":"K. Sowndarya, Y. Naidu","doi":"10.37622/gjpam/15.4.2019.499-504","DOIUrl":"https://doi.org/10.37622/gjpam/15.4.2019.499-504","url":null,"abstract":"The proper coloring of a graph G is said to be a dominator coloring if each vertex of the graph dominates every vertex of some color class. The minimum number of color classes required to satisfy the condition of dominator coloring is said to be dominator chromatic number which is denoted by χd(G). Total dominator coloring is defined to be a proper coloring of G with a property that every vertex of G dominates all the vertices of at least one color class (other than the class itself). The minimum number of color classes required to satisfy the condition of total dominator coloring is called total dominator chromatic number and is denoted by χtd(G). In this paper, we would discuss the dominator and total dominator coloring parameters of bishops and rooks on square chessboard and give the values for dominator chromatic number and total dominator chromatic number for these chessboard graphs.","PeriodicalId":198465,"journal":{"name":"Global Journal of Pure and Applied Mathematics","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127001506","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-04-30DOI: 10.37622/gjpam/15.2.2019.147-160
R. Vasuki
Let G = (V,E) be a graph with p vertices and q edges. A graph G is said to have an odd mean labeling if there exists a function f : V (G)→ {0, 1, 2, . . . , 2q − 1} satisfying f is 1 − 1 and the induced map f∗ : E(G) → {1, 3, 5, . . . , 2q − 1} defined by f∗(uv) = { f(u)+f(v) 2 if f(u) + f(v) is even f(u)+f(v)+1 2 if f(u) + f(v) is odd. is a bijection. A graph that admits an odd mean labeling is called an odd mean graph. Here we study about the odd mean behaviour of some standard graphs.
{"title":"Further Results On Odd Mean Graphs","authors":"R. Vasuki","doi":"10.37622/gjpam/15.2.2019.147-160","DOIUrl":"https://doi.org/10.37622/gjpam/15.2.2019.147-160","url":null,"abstract":"Let G = (V,E) be a graph with p vertices and q edges. A graph G is said to have an odd mean labeling if there exists a function f : V (G)→ {0, 1, 2, . . . , 2q − 1} satisfying f is 1 − 1 and the induced map f∗ : E(G) → {1, 3, 5, . . . , 2q − 1} defined by f∗(uv) = { f(u)+f(v) 2 if f(u) + f(v) is even f(u)+f(v)+1 2 if f(u) + f(v) is odd. is a bijection. A graph that admits an odd mean labeling is called an odd mean graph. Here we study about the odd mean behaviour of some standard graphs.","PeriodicalId":198465,"journal":{"name":"Global Journal of Pure and Applied Mathematics","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125138748","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：