Real world applications of discrete mathematics
Downloads
Abstract
Discrete mathematics is an important branch of applied mathematics and graph theory is an important part of
discrete mathematics. It have lot of applications in modern society. Graph colouring or graph labeling is an
important branch of graph theory which can easily solve many real life problems. In this article, we have shown
some direct applications of discrete mathematics, like applications of graph theory to scheduling problems,
coloring of map in GSM mobile phone networks, google maps or GPS, traffic signal lights, Social networks,
aircraft scheduling, etc.
Keywords:
colouring, scheduling problem, interval graphMathematics Subject Classification:
Mathematics- Pages: 152-158
- Date Published: 01-01-2021
- Vol. 9 No. 01 (2021): Malaya Journal of Matematik (MJM)
A. Saha, M. Pal and T. K. Pal, Selection of programme slots of television channels for giving advertisement: A graph theoretic approach, Information Science, 177(12) $(2007) 2480-2492$.
S. Venu Madhav Sarma, Applications of graph theory in human life International Journal of Computer Application, $1(2)(2012) 1-10$.
Sk. Amanathulla and M. Pal, $L(0,1)$ - and $L(1,1)$ labelling problems on circular-arc graphs, International Journal of Soft Computing, 11(6) (2016) 343-350.
Sk. Amanathulla and M. Pal, $L(3,2,1)$ - and $L(4,3,2,1)$ labelling problems on circular-arc graphs, International Journal of Control Theory and Applications, 9(34) (2016) 869-884.
Sk. Amanathulla and M. Pal, $L(3,2,1)$-labelling problems on permutation graphs, Transylvanian Review, $25(14), 20173939-3953$.
Sk. Amanathulla and M. Pal, $Lleft(h_1, h_2, ldots, h_mright)$-labelling problems on interval graphs, International Journal of Control Theory and Applications, $10(01)$ (2017) 467-479.
Sk. Amanathulla and M. Pal, $L(3,2,1)$ - and $L(4,3,2,1)$ labelling problems on interval graphs, AKCE International Journal of Graphs and Combinatorics, 14 (2017) 205-215.
Sk. Amanathulla and M. Pal, $Lleft(h_1, h_2, ldots, h_mright)$-labelling problems on circular-are graphs, Far East Journal of Mathematical Sciences, 102(6) (2017) 1279-1300.
Sk. Amanathulla and M. Pal, Surjective $L(2,1)$-labelling of cycles and circular-arc graphs, Journal of Intelligent and Fuzzy Systems, 35 (2018), 739-748.
Sk. Amanathulla and M. Pal, $L(1,1,1)=$ and $L(1,1,1,1)$ labeling problems of square of paths, complete graphs and complete bipartite graphs, Far East Journal of Mathematical Sciences, $106(2)$ (2018) $515-527$.
Sk. Amanathulla, M. Pal and Sankar Sahoo, $L(3,1,1)$ labeling numbers of squares of paths, complete graphs and complete bipartite graphs, Journal of Intelligent and Fuzzy Systems, 36 (2019) 1917-1925.
Sk. Amanathulla and M. Pal, $L(h, k)$-labelling problems on intersection graphs, In Handbook of Research on Advanced Applications of Graph Theory in Modern Society (pp. 437-468). IGI Global.
M S Vinutha and Arathi P, Applications of graph coloring and labeling in computer science, International Journal on Future Revolution in Computer Science and Communication Engineering, 3 (8) 14-16.
Metrics
Published
How to Cite
Issue
Section
License
Copyright (c) 2021 MJM
This work is licensed under a Creative Commons Attribution 4.0 International License.
