Implementation of Graph Colouring Technique in Crime Science
B. Logeshwary
B. Logeshwary*, Department of Mathematics, A.M Jain College, Meenambakkam, Chennnai, India.
Manuscript received on March 15, 2020. | Revised Manuscript received on March 24, 2020. | Manuscript published on March 30, 2020. | PP: 4234-4237 | Volume-8 Issue-6, March 2020. | Retrieval Number: F9355038620/2020©BEIESP | DOI: 10.35940/ijrte.F9355.038620
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: This paper deals with the new method of graph colouring technique implemented in crime science. The graphical investigation uses the elements of graph theory to identify the suspects involved in unlawful act. The research paper focuses on the idea of graph colouring technique in crime problem which provides mathematical clarity for investigation in identifying the suspects. This method helps the crime scientist to expedite the investigation process to reduce time factor in decision making.
Keywords: Proper Vertex Colouring, Proper Edge Colouring, Crime Investigation Problem.
Scope of the Article: Computational Techniques in Civil Engineering.