iosr-Jm   Volume-20 ~ Issue-2 ~ Mar. – Apr. 2024

Abstract : Carefully crafted policies are necessary to provide appropriate allocating beds, superior medical care, and sufficient financial assistance in the face of limited healthcare resources. This research integrates an optimization method based on evolution, a compartmental model, and a queuing system into a single framework to offer a complicated investigation of the distribution of resources in the medical field. The compartmental model offers a workable hospital division structure according to with defining qualities of the queuing system, and employing......

Key Word: Customer, Queue, Bed occupancy, Phase type Queuing Model

[1] Belciug, S., & Gorunescu, F. (2015). Improving Hospital Bed Occupancy And Resource Utilization Through Queuing Modeling And Evolutionary Computation. Journal Of Biomedical Informatics, 53, 261-269.
[2] Cochran, J. K., & Roche, K. T. (2009). A Multi-Class Queuing Network Analysis Methodology For Improving Hospital Emergency Department Performance. Computers & Operations Research, 36(5), 1497-1512.
[3] Cooper, R. B. (1990). Queueing Theory. Handbooks In Operations Research And Management Science, 2, 469-518.
[4] Currie, C. S., & Lu, L. (2009). Optimal Scheduling Using Length-Of-Stay Data For Diverse Routine Procedures. Intelligent Patient Management, 193-205.
[5] De Bruin, A. M., Bekker, R., Van Zanten, L., & Koole, G. M. (2010). Dimensioning Hospital Wards Using The Erlang Loss Model. Annals Of Operations Research, 178, 23-43..

Abstract : In this paper, I have discussed the total chromatic number of Snake graphs viz., like Triangular Snake and its sub classes of graphs, Quadrilateral Snake graphs and its sub classes of graphs, Ladder Graph and Polygonal Chain. The total chromatic number of a graph G is defined as the assignment of minimum number of colors, to color the vertices, V(G) and the edges, E(G) of a graph in such a way that no two adjacent vertices nor no two adjacent edges receive same color, and no incident vertex and edge receive the same color.

Key Word: Snake graph, total chromatic number, triangular snake, double star, Triangular Snake, Double Triangular Snake, Alternating Triangular Snake, Alternating Double Triangular Snake, Quadrilateral Snake, Double Quadrilateral Snake, Alternating Double Quadrilateral Snake, Ladder Graph, Polygonal Chain

[1] Rosa, "Cyclic Steiner Triple Systems And Labelings Of Triangular Cacti", Scientia, 5,87-95, (1967).
[2] V Kostochka, The Total Chromatic Number Of Any Multigraph With Maximum Degree Five Is At Most Seven, Discrete Math, 162, Pp.199-214, (1996),
[3] C Ramaprakash, M I Huilgol, " New Results On Edge Rotation Distance Graphs", International Journal Of Mathematics And Soft Computing Vol.6,No.1,81-91, 2016.
[4] D. B. West , "Introduction To Graph Theory", Pearson India, (2015).
[5] G. Chartrand And Ping Zhang, "Introduction To Graph Theory", Tata Mcgraw Hill, (2006)..