Pub Date : 2024-03-09DOI: 10.9734/arjom/2024/v20i2785
S. V. S. Padiyar, Krati Jain, Deepa Makholia, Raghawendra Mishra
The integrated inventory model works like a multi-tier supply chain involving a manufacturer, buyer, supplier, and customer. In the proposed article, integrated inventory management for perishable items has been developed. It is an essential responsibility of every supply chain member to ensure that any inventory can be delivered to the customer smoothly and on time. The model of inflation fluctuations takes into account inflation as one of its factors. This model considers the movement of inventory from production to supply in real data; Numerical examples have been explored to facilitate a practical understanding of this model in real-life situations, and the aggregate cost from the entire supply chain has been calculated. The model concludes with a sensitivity analysis, revealing the effects on the overall model stemming from alterations in key parameters that exert significant influence.
{"title":"Integrated Inventory Model with Inflation for Deteriorating Items","authors":"S. V. S. Padiyar, Krati Jain, Deepa Makholia, Raghawendra Mishra","doi":"10.9734/arjom/2024/v20i2785","DOIUrl":"https://doi.org/10.9734/arjom/2024/v20i2785","url":null,"abstract":"The integrated inventory model works like a multi-tier supply chain involving a manufacturer, buyer, supplier, and customer. In the proposed article, integrated inventory management for perishable items has been developed. It is an essential responsibility of every supply chain member to ensure that any inventory can be delivered to the customer smoothly and on time. The model of inflation fluctuations takes into account inflation as one of its factors. This model considers the movement of inventory from production to supply in real data; Numerical examples have been explored to facilitate a practical understanding of this model in real-life situations, and the aggregate cost from the entire supply chain has been calculated. The model concludes with a sensitivity analysis, revealing the effects on the overall model stemming from alterations in key parameters that exert significant influence.","PeriodicalId":505328,"journal":{"name":"Asian Research Journal of Mathematics","volume":"173 5","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140256443","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 : 2024-03-09DOI: 10.9734/arjom/2024/v20i2784
Jusriadi, S. Abusini, Vira Hari Krisnawati
Graph theory is a branch of mathematics that studies the structure and describes the relationships between vertices and edges. In general, graph theory is used to represent discrete objects (vertices) and the relationships between them (edges). A path that can pass through each edge exactly once in a graph is called a directed graph Euler path. One way to find Euler paths is by using Fleury's algorithm. Fleury's algorithm is designed to find Euler paths in directed graphs. This article examines the application of Fleury's algorithm to the determination of a transportation route in a city interpreted in a directed graph. The case study in this research focuses on the trans Mamminasata bus route in Makassar city Indonesia with the aim of implementing Fleury's algorithm in bus route generation. The result obtained from the simulation using Fleury's algorithm is that all edges can be visited exactly once, so that an Euler path is formed on the transportation route. The route formed from the Euler trajectory will be a comparison of the current route to determine the operational efficiency of the bus route network in the city.
{"title":"Analysis of City Transportation Routes with Fleury Algorithm on Bus Route Network: Case Study of Trans Mamminasata Makassar City Indonesia","authors":"Jusriadi, S. Abusini, Vira Hari Krisnawati","doi":"10.9734/arjom/2024/v20i2784","DOIUrl":"https://doi.org/10.9734/arjom/2024/v20i2784","url":null,"abstract":"Graph theory is a branch of mathematics that studies the structure and describes the relationships between vertices and edges. In general, graph theory is used to represent discrete objects (vertices) and the relationships between them (edges). A path that can pass through each edge exactly once in a graph is called a directed graph Euler path. One way to find Euler paths is by using Fleury's algorithm. Fleury's algorithm is designed to find Euler paths in directed graphs. This article examines the application of Fleury's algorithm to the determination of a transportation route in a city interpreted in a directed graph. The case study in this research focuses on the trans Mamminasata bus route in Makassar city Indonesia with the aim of implementing Fleury's algorithm in bus route generation. The result obtained from the simulation using Fleury's algorithm is that all edges can be visited exactly once, so that an Euler path is formed on the transportation route. The route formed from the Euler trajectory will be a comparison of the current route to determine the operational efficiency of the bus route network in the city.","PeriodicalId":505328,"journal":{"name":"Asian Research Journal of Mathematics","volume":"237 6","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140256347","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 : 2024-03-05DOI: 10.9734/arjom/2024/v20i2783
Tejaskumar R., A. Ismayil
Kathiresan In this article, bandwagon eccentric domination polynomial BED (G , x) is introduced. Theorems related to the characteristics of coefficients of BED (Sn ,x) of a star graph is discussed and the coefficients of BED (Sn ,x) are tabulated. Minimum bandwagon eccentric dominating energy IEbed (G) is also defined. IEbed (G) of families of graphs are computed and the properties of minimum bandwagon eccentric dominating eigenvalues are obtained. Results related to upper and lower bounds for IEbed (G) of cocktail party, complete, crown and star graphs are discussed.
Kathiresan 本文介绍了带状偏心支配多项式 BED (G , x)。文章讨论了与星形图 BED (Sn ,x) 的系数特征有关的定理，并将 BED (Sn ,x) 的系数列成表格。还定义了最小带状偏心支配能 IEbed (G)。计算了图形族的 IEbed (G)，并获得了最小带状偏心支配特征值的性质。讨论了鸡尾酒会图、完整图、皇冠图和星形图的 IEbed (G) 的上下限相关结果。
{"title":"Bandwagon Eccentric Domination Polynomial and its Energy in Graphs","authors":"Tejaskumar R., A. Ismayil","doi":"10.9734/arjom/2024/v20i2783","DOIUrl":"https://doi.org/10.9734/arjom/2024/v20i2783","url":null,"abstract":"Kathiresan In this article, bandwagon eccentric domination polynomial BED (G , x) is introduced. Theorems related to the characteristics of coefficients of BED (Sn ,x) of a star graph is discussed and the coefficients of BED (Sn ,x) are tabulated. Minimum bandwagon eccentric dominating energy IEbed (G) is also defined. IEbed (G) of families of graphs are computed and the properties of minimum bandwagon eccentric dominating eigenvalues are obtained. Results related to upper and lower bounds for IEbed (G) of cocktail party, complete, crown and star graphs are discussed.\u0000 ","PeriodicalId":505328,"journal":{"name":"Asian Research Journal of Mathematics","volume":"117 45","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140079473","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 : 2024-02-17DOI: 10.9734/arjom/2024/v20i1780
Riyaz Ur Rehman A., A. Ismayil
The minimum injective eccentric dominating energy of a graph is defined. The minimum injective eccentric dominating energy for star, complete and cocktail party graphs are computed. Inspired by McClelland’s bounds for energy of a graph, the upper and lower bounds of minimum injective eccentric dominating energy for star, complete and cocktail party graphs are discussed. Properties of eigenvalues of minimum injective eccentric dominating matrix for star, complete and cocktail party graphs are discussed.
{"title":"Minimum Injective Eccentric Dominating Energy of Graphs","authors":"Riyaz Ur Rehman A., A. Ismayil","doi":"10.9734/arjom/2024/v20i1780","DOIUrl":"https://doi.org/10.9734/arjom/2024/v20i1780","url":null,"abstract":"The minimum injective eccentric dominating energy of a graph is defined. The minimum injective eccentric dominating energy for star, complete and cocktail party graphs are computed. Inspired by McClelland’s bounds for energy of a graph, the upper and lower bounds of minimum injective eccentric dominating energy for star, complete and cocktail party graphs are discussed. Properties of eigenvalues of minimum injective eccentric dominating matrix for star, complete and cocktail party graphs are discussed.","PeriodicalId":505328,"journal":{"name":"Asian Research Journal of Mathematics","volume":"57 2","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139960396","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
扫码关注我们
求助内容：
应助结果提醒方式：