Christiana Rini Indrati
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Christiana Rini Indrati has a total of 30 co-authors. Here are the top co-authors by number of shared publications:
- Isnaini Rosyida
Universitas Negeri Semarang
5 shared publications Widodo
4 shared publicationsKiki A. Sugeng
Department of Mathematics, University of Indonesia, Depok, Indonesia
3 shared publicationsLina Aryati
Mathematics Department of Universitas Gadjah Mada, Yogyakarta, Indonesia
3 shared publicationsSoeparna Darmawijaya
3 shared publications- Sutrima
Mathematics Department, Sebelas Maret University, Surakarta, Indonesia
3 shared publications
Latest Publications
- Open Access
- 21 February 2025
- Published by EDP Sciences in ITM Web of Conferences
- Vol. 75, 01001
Some Fixed-Point Theorems on Quasi M-Metric Spaces
In this paper, it will be discussed a metric that is constructed based on a quasi M-metric and a new definition of Cauchy sequences in quasi M-metric spaces. The discussion will be continued by giving a relationship between completeness in the quasi M-metric space and the constructed metric space. Furthermore, it will be developed some fixed-point theorems on quasi M-metric spaces.
- 21 February 2025
- Published by EDP Sciences in ITM Web of Conferences
- Vol. 75, 01001
Open AccessSome Fixed-Point Theorems on Quasi M-Metric Spaces
In this paper, it will be discussed a metric that is constructed based on a quasi M-metric and a new definition of Cauchy sequences in quasi M-metric spaces. The discussion will be continued by giving a relationship between completeness in the quasi M-metric space and the constructed metric space. Furthermore, it will be developed some fixed-point theorems on quasi M-metric spaces.
- 1 January 2024
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 3029 (1) , 040002
Countably Lipschitz condition in metric space
In this paper, it will be defined the countably Lipschitz condition (CLC) in metric spaces. From the definition of CLC and its characteristics, it will be deter In this paper, it will be defined the countably Lipschitz condition (CLC) in metric spaces. From the definition of CLC and its characteristics, it will be deter
- 1 January 2024
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 3029 (1) , 040002
Countably Lipschitz condition in metric space
In this paper, it will be defined the countably Lipschitz condition (CLC) in metric spaces. From the definition of CLC and its characteristics, it will be deter In this paper, it will be defined the countably Lipschitz condition (CLC) in metric spaces. From the definition of CLC and its characteristics, it will be deter
- 1 January 2024
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 3029 (1) , 040006
Fundamental solution of Sturm-Liouville equation
Picard’s Theorem guarantees a unique solution of the ordinary differential equation (ODE) either systems of ODEs or the n-th order ODE. In this paper, it will b Picard’s Theorem guarantees a unique solution of the ordinary differential equation (ODE) either systems of ODEs or the n-th order ODE. In this paper, it will b
- 1 January 2024
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 3029 (1) , 040006
Fundamental solution of Sturm-Liouville equation
Picard’s Theorem guarantees a unique solution of the ordinary differential equation (ODE) either systems of ODEs or the n-th order ODE. In this paper, it will b Picard’s Theorem guarantees a unique solution of the ordinary differential equation (ODE) either systems of ODEs or the n-th order ODE. In this paper, it will b
- Open Access
- 30 November 2023
- Published by MDPI AG in Algorithms
- Vol. 16 (12) , 551
An Algorithm for Coloring of Picture Fuzzy Graphs Based on Strong and Weak Adjacencies, and Its Application
The idea of strong and weak adjacencies between vertices has been generalized into fuzzy graphs and intuitionistic fuzzy graphs (IFGs), and it is an important part of making decisions. However, one or two membership degrees are not always sufficient for making decisions on real-world problems that need an answer of types “yes, neutral, and no”. Consequently, in previous work, we generalized the concept into picture fuzzy graphs (PFGs) where each element in the PFG has membership, neutral, and non-membership degrees. Moreover, we constructed the notion of the coloring of PFGs based on strong and weak adjacencies between vertices. In this paper, we investigate some properties of the chromatic number of PFGs based on the concept of strong and weak adjacencies between vertices. According to these properties, we construct an algorithm to find the chromatic number of PFGs. The algorithm is useful when we work with large PFGs. Further, we improve the method to implement the PFG’s coloring for determining traffic signal phasing at an intersection. A case study has also been carried to evaluate the method.
- 30 November 2023
- Published by MDPI AG in Algorithms
- Vol. 16 (12) , 551
Open AccessAn Algorithm for Coloring of Picture Fuzzy Graphs Based on Strong and Weak Adjacencies, and Its Application
The idea of strong and weak adjacencies between vertices has been generalized into fuzzy graphs and intuitionistic fuzzy graphs (IFGs), and it is an important part of making decisions. However, one or two membership degrees are not always sufficient for making decisions on real-world problems that need an answer of types “yes, neutral, and no”. Consequently, in previous work, we generalized the concept into picture fuzzy graphs (PFGs) where each element in the PFG has membership, neutral, and non-membership degrees. Moreover, we constructed the notion of the coloring of PFGs based on strong and weak adjacencies between vertices. In this paper, we investigate some properties of the chromatic number of PFGs based on the concept of strong and weak adjacencies between vertices. According to these properties, we construct an algorithm to find the chromatic number of PFGs. The algorithm is useful when we work with large PFGs. Further, we improve the method to implement the PFG’s coloring for determining traffic signal phasing at an intersection. A case study has also been carried to evaluate the method.
- Open Access
- 7 November 2023
- Published by MDPI AG in Preprints.org
An Algorithm for Coloring of Picture Fuzzy Graphs Based on Strong and Weak Adjacencies and its Application
The idea of strong and weak adjacencies between vertices has been generalized into fuzzy graphs and intuitionistic fuzzy graphs (IFGs) and it is an important part of making decisions. However, one or two membership degrees are not always sufficient for making decisions on real-world problems that need an answer of types “yes, neutral, and no". Consequently, in previous work, we generalized the concept into picture fuzzy graphs (PFGs) where each element in the PFG has membership, neutral, and non-membership degrees. Moreover, we constructed the notion of the coloring of PFGs based on strong and weak adjacencies between vertices. In this paper, we investigate some properties of the chromatic number of PFGs based on the concept of strong and weak adjacencies between vertices. According to the properties, we construct an algorithm to find the chromatic number of PFGs. The algorithm is usefull when we work with large PFGs. Further, we improve the method to implement the PFG’s coloring for determining traffic signal phasing at an intersection. A case study has also been done to evaluate the method.
- 7 November 2023
- Published by MDPI AG in Preprints.org
Open AccessAn Algorithm for Coloring of Picture Fuzzy Graphs Based on Strong and Weak Adjacencies and its Application
The idea of strong and weak adjacencies between vertices has been generalized into fuzzy graphs and intuitionistic fuzzy graphs (IFGs) and it is an important part of making decisions. However, one or two membership degrees are not always sufficient for making decisions on real-world problems that need an answer of types “yes, neutral, and no". Consequently, in previous work, we generalized the concept into picture fuzzy graphs (PFGs) where each element in the PFG has membership, neutral, and non-membership degrees. Moreover, we constructed the notion of the coloring of PFGs based on strong and weak adjacencies between vertices. In this paper, we investigate some properties of the chromatic number of PFGs based on the concept of strong and weak adjacencies between vertices. According to the properties, we construct an algorithm to find the chromatic number of PFGs. The algorithm is usefull when we work with large PFGs. Further, we improve the method to implement the PFG’s coloring for determining traffic signal phasing at an intersection. A case study has also been done to evaluate the method.
- 17 August 2023
- Published by Springer Nature
- p. 293-303
A Method Based on Picture Fuzzy Graph Coloring for Determining Traffic Signal Phasing on an Intersection
- 17 August 2023
- Published by Springer Nature
- p. 293-303
A Method Based on Picture Fuzzy Graph Coloring for Determining Traffic Signal Phasing on an Intersection
- Open Access
- 5 May 2023
- Published by Komunitas Analisis Matematika Indonesia in Hilbert Journal of Mathematical Analysis
- Vol. 1 (2) , 59-64
Sufficient conditions from countably Lipschitz to be strongly generalized absolutely continuous
The CL-integral is an integral that is defined by using countably Lipschitz condition. The CL-integral is more general than the Lebesgue integral, but it is more specific than Denjoy integral in the wide sense. The Denjoy integral in the wide sense is more general than the Henstock-Kurzweil integral. In this paper, it will be given some conditions such that a CL-integrable function is Henctock-Kurzweil-integrable on [a, b].
- 5 May 2023
- Published by Komunitas Analisis Matematika Indonesia in Hilbert Journal of Mathematical Analysis
- Vol. 1 (2) , 59-64
Open AccessSufficient conditions from countably Lipschitz to be strongly generalized absolutely continuous
The CL-integral is an integral that is defined by using countably Lipschitz condition. The CL-integral is more general than the Lebesgue integral, but it is more specific than Denjoy integral in the wide sense. The Denjoy integral in the wide sense is more general than the Henstock-Kurzweil integral. In this paper, it will be given some conditions such that a CL-integrable function is Henctock-Kurzweil-integrable on [a, b].
- Open Access
- 22 April 2023
- Published by Wiley in Abstract and Applied Analysis
- Vol. 2023, 1-5
Fixed-Point Theorems Involving Lipschitz in the Small
Lipschitz in the small is a generalization of the Lipschitz condition. The Lipschitz condition guarantees the uniqueness of the solution of the initial value problems. A special Lipschitz condition in the small is a contraction in the small. Based on the Lipschitz in the small in this paper, fixed-point theorems involving contraction in the small will be presented. The results will be applied to develop Picard’s theorem.
- 22 April 2023
- Published by Wiley in Abstract and Applied Analysis
- Vol. 2023, 1-5
Open AccessFixed-Point Theorems Involving Lipschitz in the Small
Lipschitz in the small is a generalization of the Lipschitz condition. The Lipschitz condition guarantees the uniqueness of the solution of the initial value problems. A special Lipschitz condition in the small is a contraction in the small. Based on the Lipschitz in the small in this paper, fixed-point theorems involving contraction in the small will be presented. The results will be applied to develop Picard’s theorem.
- 1 April 2020
- Published by Elsevier in Fuzzy Sets and Systems
- Vol. 384, 115-131
Fuzzy chromatic number of union of fuzzy graphs: An algorithm, properties and its application
- 1 April 2020
- Published by Elsevier in Fuzzy Sets and Systems
- Vol. 384, 115-131
Fuzzy chromatic number of union of fuzzy graphs: An algorithm, properties and its application
- Open Access
- 19 December 2019
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 2192 (1) , 050004
Basic properties and some convergence theorems of the DL-integral
The DL-integral is a Riemann-type integral which is given in [2,4]. The uniqueness of the DL-integral and the relation between the DL-integral and the Henstock integral has already been discussed in [4] but did not discuss the properties and the convergence theorems of the DL-integral. Therefore, we prove the basic properties and some convergence theorems of the DL-integral.
- 19 December 2019
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 2192 (1) , 050004
Open AccessBasic properties and some convergence theorems of the DL-integral
The DL-integral is a Riemann-type integral which is given in [2,4]. The uniqueness of the DL-integral and the relation between the DL-integral and the Henstock integral has already been discussed in [4] but did not discuss the properties and the convergence theorems of the DL-integral. Therefore, we prove the basic properties and some convergence theorems of the DL-integral.