ANALYSIS OF RESOLVING EFFICIENT DOMINATING SET AND ITS APPLICATION SCHEME IN SOLVING ETLE PROBLEMS

  • R M Prihandini Mathematics Education Program, Faculty of Teacher Training and Education, Universitas Jember, Indonesia https://orcid.org/0000-0002-6611-6458
  • M R Rahmadani Mathematics Education Program, Faculty of Teacher Training and Education, Universitas Jember, Indonesia
  • Dafik Dafik Mathematics Education Program, Faculty of Teacher Training and Education, Universitas Jember, Indonesia
DOI: https://doi.org/10.30598/barekengvol18iss3pp1615-1628
Keywords: Resolving efficient dominating set, Electronic traffic law enforcement, Graph Neural Network

Abstract

This research focuses on the analysis of Resolving Efficient Dominating Set (REDS) and its application in solving Electronic Traffic Law Enforcement (ETLE) problems using the Spatial Temporal Graph Neural Network (STGNN). Resolving Efficient Dominating Set (REDS) is a concept in graph theory that studies a set of points in a graph that efficiently monitors other points. It involves ensuring that each point v ∈ V (G) - D is dominated by exactly one point in D, with no adjacent points in D, and the representation of point v ∈ V (G) concerning D is not the same, which is termed as a resolving efficient dominating set.  In the context of Electronic Traffic Law Enforcement (ETLE), the analysis of REDS has a significant impact. The theorem resulting from the analysis of REDS enables the determination of the number of traffic violation sensors required. Furthermore, by taking simulation data from road points, violation forecasting can be performed. The accurate predictions from this forecasting can assist authorities in anticipating and addressing traffic violation issues more effectively.

Downloads

Download data is not yet available.

References

F. A. Abdullah and F. Windiyastuti, “Electronic Traffic Law Enforcement ( ETLE ) sebagai Digitalisasi Proses Tilang,” J. Kewarganegaraan, vol. 6, no. 2, pp. 3004–3008, 2022.

V. M. Benyamin Lufpi, “Efektivitas Electronic Traffic Law Enforcement,” J. Ilmu Kepol., vol. 16, no. 1, p. 9, 2022, doi: 10.35879/jik.v16i1.350.

R. Diestel, Graph Theory (on Demand Printing Of 02787). 2018. doi: 10.1201/9780429493768.

B. G. Theory and O. Riordan, “B8.511b Graph Theory,” 2016.

R. A. Hakim, Dafik, I. M. Tirta, R. M. Prihandini, and I. H. Agustin, “On resolving efficient domination number of comb product of special graphs,” J. Phys. Conf. Ser., vol. 1832, no. 1, 2021, doi: 10.1088/1742-6596/1832/1/012018.

I. Kusumawardani, Dafik, E. Y. Kurniawati, I. H. Agustin, and R. Alfarisi, “On resolving efficient domination number of path and comb product of special graph,” J. Phys. Conf. Ser., vol. 2157, no. 1, 2022, doi: 10.1088/1742-6596/2157/1/012012.

Y. Wangguway, Slamin, D. Dafik, D. A. R. Wardani, and R. Alfarisi, “On resolving domination number of special family of graphs,” J. Phys. Conf. Ser., vol. 1465, no. 1, 2020, doi: 10.1088/1742-6596/1465/1/012015.

A. Brandstädt, A. Leitert, and D. Rautenbach, “Efficient dominating and edge dominating sets for graphs and hypergraphs,” Lect. Notes Comput. Sci. (including Subser. Lect. Notes Artif. Intell. Lect. Notes Bioinformatics), vol. 7676 LNCS, no. July 2012, pp. 267–277, 2012, doi: 10.1007/978-3-642-35261-4_30.

Dafik, I. H. Agustin, E. R. Albirri, R. Alfarisi, and R. M. Prihandini, “Locating domination number of m-shadowing of graphs,” J. Phys. Conf. Ser., vol. 1008, no. 1, 2018, doi: 10.1088/1742-6596/1008/1/012041.

R. C. Brigham, G. Chartrand, R. D. Dutton, and P. Zhang, “Resolving domination in graphs,” Math. Bohem., vol. 128, no. 1, pp. 25–36, 2003, doi: 10.21136/mb.2003.133935.

G. Chartrand, F. Okamoto, and P. Zhang, “The metric chromatic number of a graph,” Australas. J. Comb., vol. 44, no. 2, pp. 273–286, 2009.

D. A. R. Wardani, D. Dafik, I. H. Agustin, M. Marsidi, and C. D. Putri, “On the LIDS of corona product of graphs,” AIP Conf. Proc., vol. 2014, pp. 1–8, 2018, doi: 10.1063/1.5054491.

R. Adawiyah and R. M. Prihandini, “Dimensi Metrik Sisi Pada Keluarga Graf Tangga,” pp. 34–39, 2021.

R. Alfarisi, Dafik, R. Adawiyah, R. M. Prihandini, E. R. Albirri, and I. H. Agustin, “Super domination number of unicyclic graphs,” IOP Conf. Ser. Earth Environ. Sci., vol. 243, no. 1, 2019, doi: 10.1088/1755-1315/243/1/012074.

F. Scarselli, M. Gori, A. C. Tsoi, M. Hagenbuchner, and G. Monfardini, “The graph neural network model,” IEEE Trans. Neural Networks, vol. 20, no. 1, pp. 61–80, 2009, doi: 10.1109/TNN.2008.2005605.

Published
2024-08-02
How to Cite
[1]
R. Prihandini, M. Rahmadani, and D. Dafik, “ANALYSIS OF RESOLVING EFFICIENT DOMINATING SET AND ITS APPLICATION SCHEME IN SOLVING ETLE PROBLEMS”, BAREKENG: J. Math. & App., vol. 18, no. 3, pp. 1615-1628, Aug. 2024.
Issue
Vol 18 No 3 (2024): BAREKENG: Journal of Mathematics and Its Application
Section
Articles

Copyright (c) 2024 R M Prihandini, M R Rahmadani, Dafik Dafik

Creative Commons License

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Authors who publish with this Journal agree to the following terms:

  1. Author retain copyright and grant the journal right of first publication with the work simultaneously licensed under a creative commons attribution license that allow others to share the work within an acknowledgement of the work’s authorship and initial publication of this journal.
  2. Authors are able to enter into separate, additional contractual arrangement for the non-exclusive distribution of the journal’s published version of the work (e.g. acknowledgement of its initial publication in this journal).
  3. Authors are permitted and encouraged to post their work online (e.g. in institutional repositories or on their websites) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published works.