scholarly journals Concepts on Coloring of Cluster Hypergraphs with Application

2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Sovan Samanta ◽  
Jeong Gon Lee ◽  
Usman Naseem ◽  
Shah Khalid Khan ◽  
Kousik Das
Keyword(s):  
Graph Theory ◽  
Proper Coloring ◽  
Traffic Light ◽  
Cluster Network ◽  
Cluster Networks ◽  
Map Coloring

Coloring of graph theory is widely used in different fields like the map coloring, traffic light problems, etc. Hypergraphs are an extension of graph theory where edges contain single or multiple vertices. This study analyzes cluster hypergraphs where cluster vertices too contain simple vertices. Coloring of cluster networks where composite/cluster vertices exist is done using the concept of coloring of cluster hypergraphs. Proper coloring and strong coloring of cluster hypergraphs have been defined. Along with these, local coloring in cluster hypergraphs is also provided. Such a cluster network, COVID19 affected network, is assumed and colored to visualize the affected regions properly.

scholarly journals Region Coloring in Minahasa Regency Using Sequential Color Algorithm

d'CARTESIAN ◽  
2019 ◽  
Vol 8 (2) ◽  
pp. 86
Author(s):  
Yevie Ingamita ◽  
Nelson Nainggolan ◽  
Benny Pinontoan
Keyword(s):  
Graph Theory ◽  
Positive Integer ◽  
Chromatic Number ◽  
Human Life ◽  
Minimum Number ◽  
Mathematical Sciences ◽  
Map Coloring ◽  
Graph Application

Graph Theory is one of the mathematical sciences whose application is very wide in human life. One of theory graph application is Map Coloring. This research discusses how to color the map of Minahasa Regency by using the minimum color that possible. The algorithm used to determine the minimum color in coloring the region of Minahasa Regency that is Sequential Color Algorithm. The Sequential Color Algorithm is an algorithm used in coloring a graph with k-color, where k is a positive integer. Based on the results of this research was found that the Sequential Color Algorithm can be used to color the map of Minahasa Regency with the minimum number of colors or chromatic number χ(G) obtained in the coloring of 25 sub-districts on the map of Minahasa Regency are 3 colors (χ(G) = 3).

Improved earthquake location in the gold mining regions of South Africa using new velocity models

2020 ◽  
Vol 123 (1) ◽  
pp. 35-58
Author(s):  
V. Midzi ◽  
T. Pule ◽  
B. Manzunzu ◽  
T. Mulabisana ◽  
B.S. Zulu ◽  
...  
Keyword(s):  
Quality Criteria ◽  
Velocity Model ◽  
Quality Data ◽  
Velocity Models ◽  
Earthquake Locations ◽  
Cluster Network ◽  
Cluster Networks ◽  
Parametric Data ◽  
New Locations ◽  
Local Earthquake

Abstract Reliable local earthquake locations depend on many factors of which a major one is the velocity model. Currently the Council for Geoscience (CGS) has been using the global IASP91 velocity model for earthquake locations in the cluster networks. To continue improving the earthquake locations it is necessary that new velocity models are determined for each cluster region (Central and East Rand - CERAND, the Klerksdorp – Orkney – Stilfontein – Hartebeesfontein – KOSH and the Far West and West Rand - WRAND). The availability of good quality data recorded by the cluster networks since their inception in 2010 provides an opportunity to conduct this work. Thus data from the cluster networks database were selected according to set quality criteria to obtain parametric data for 130 earthquakes in the CERAND region, 404 in the KOSH region and 1024 in the WRAND region. These data were used to determine a minimum 1-D velocity model with associated station corrections for each of the regions using the VELEST software package. Comparison of epicentres obtained using the new velocity models to epicentres previously published by the CGS, showed improvement in the quality of the new locations. Thus, the new models will be implemented in the day-to-day analysis of data recorded in the three study regions by the cluster network of stations.

scholarly journals IMPLEMENTATION OF BUSINESS EXCELLENCE MODEL IN CLUSTER ENVIRONMENT

2017 ◽  
Vol 45 (4) ◽  
pp. 27
Author(s):  
Slobodan Morača ◽  
N Cvetković ◽  
Angela Fajsi ◽  
M Jovanović
Keyword(s):  
Business Practices ◽  
Total Quality ◽  
Model Cluster ◽  
Competitive Edge ◽  
Innovation Potential ◽  
Cluster Network ◽  
Organizational Excellence ◽  
Cluster Networks ◽  
Business Excellence ◽  
Cluster Environment

This paper deals with Business Excellence Model (BEM) and its implementation in cluster network environment. Total Quality Management and Organizational Excellence Model have gained a lot of attention in the last two decades as a way for organizations to meliorate business practices and operations and consequently to gain competitive edge. This paper presents the major objectives and benefits that drive companies to implement BEM. Furthermore, considering the most important barriers organizations are encountering during their endeavour to implement and apply Business Excellence Model, cluster networks, as environment that facilitates the implementation of BEM, are explained, determining the manner in which clusters help overpass the main obstacles. Since clusters imply interconnection of diverse actors which promote both knowledge creation and dissemination, innovation potential increase, resource exchange and similar, they are seen as facilitating environment for implementation for Business Excellence Model.

scholarly journals SIMULATION OF ENERGY CONSUMPTION IN MULTI CLUSTER WIRELESS SENSOR NETWORKS

2018 ◽  
pp. 22-26
Author(s):  
S. I. Pella
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Performance ◽  
Network Connectivity ◽  
Wireless Sensor ◽  
Cluster Network ◽  
Cluster Networks ◽  
Energy Conserving ◽  
Single Cluster

Energy conserving protocols in wireless sensor networks (WSNs), such as S-MAC, introduce multi-cluster network. The border nodes in multi cluster WSNs have more active time than the other nodes in the network; hence have more energy depletion rate. Since battery replacement in most networks is considered difficult, one or more nodes running out of energy prematurely will affect the network connectivity and decrease the overall network performance severely. This paper aims to (1) analyze the energy consumption in a multi-cluster sensor network and compare it to the single cluster scenario (2) investigate the merging time in a single cluster network. The result shows that, in average the energy needed to deliver a packet in the multi cluster networks is about 150% more than the energy needed in the single cluster networks. Moreover, the merging time in the single cluster network using schedule offset as the merging criteria in average is slightly smaller than one in the network using schedule ID as the merging criteria.

scholarly journals Graph Theory for Primary School Students with High Skills in Mathematics

Mathematics ◽  
2021 ◽  
Vol 9 (13) ◽  
pp. 1567
Author(s):  
Rocío Blanco ◽  
Melody García-Moya
Keyword(s):  
Graph Theory ◽  
Problem Solving ◽  
Primary School ◽  
Primary School Students ◽  
School Students ◽  
Wide Range ◽  
Highly Skilled ◽  
Problem Solving Strategies ◽  
Map Coloring ◽  
Star Polygons

Graph theory is a powerful representation and problem-solving tool, but it is not included in present curriculum at school levels. In this study we perform a didactic proposal based in graph theory, to provide students useful and motivational tools for problem solving. The participants, who were highly skilled in mathematics, worked on map coloring, Eulerian cycles, star polygons and other related topics. The program included six sessions in a workshop format and four creative sessions where participants invented their own mathematical challenges. Throughout the experience they applied a wide range of strategies to solve problems, such as look for a pattern, counting strategies or draw the associated graph, among others. In addition, they created as challenges the same type of problems posed in workshops. We conclude that graph theory successfully increases motivation of participants towards mathematics and allows the appearance and enforcement of problem-solving strategies.

scholarly journals ELMOPP: an application of graph theory and machine learning to traffic light coordination

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Fareed Sheriff
Keyword(s):  
Machine Learning ◽  
Graph Theory ◽  
Traffic Flow ◽  
Traffic Congestion ◽  
Traffic Management ◽  
Short Term Memory ◽  
Traffic Light ◽  
Content Type ◽  
Past Data ◽  
The One

PurposeThis paper presents the Edge Load Management and Optimization through Pseudoflow Prediction (ELMOPP) algorithm, which aims to solve problems detailed in previous algorithms; through machine learning with nested long short-term memory (NLSTM) modules and graph theory, the algorithm attempts to predict the near future using past data and traffic patterns to inform its real-time decisions and better mitigate traffic by predicting future traffic flow based on past flow and using those predictions to both maximize present traffic flow and decrease future traffic congestion.Design/methodology/approachELMOPP was tested against the ITLC and OAF traffic management algorithms using a simulation modeled after the one presented in the ITLC paper, a single-intersection simulation.FindingsThe collected data supports the conclusion that ELMOPP statistically significantly outperforms both algorithms in throughput rate, a measure of how many vehicles are able to exit inroads every second.Originality/valueFurthermore, while ITLC and OAF require the use of GPS transponders and GPS, speed sensors and radio, respectively, ELMOPP only uses traffic light camera footage, something that is almost always readily available in contrast to GPS and speed sensors.

scholarly journals Pewarnaan Simpul Dengan Algoritma Welch-Powell Pada Traffic Light Di Yogyakarta

2013 ◽  
Vol 2 (2) ◽  
pp. 73
Author(s):  
Ana Mardiatus Soimah ◽  
Noor Saif Muhammad Mussafi
Keyword(s):  
Graph Theory ◽  
Graph Coloring ◽  
Traffic Congestion ◽  
Red Light ◽  
Green Light ◽  
Secondary Data ◽  
Traffic Light ◽  
Light Traffic ◽  
Big Cities ◽  
Alternative Solutions

Traffic congestion is a problem which is often found in big cities in Indonesia. This requires a range of solutions, one of them with the settings of the traffic light. Traffic light arrangement can be completed with graph theory. Part of graph theory a graph coloring is used. Staining graf three i.e. coloring is differentiated into a knot, staining the sides, and staining region. This research examines the arrangements about traffic light using colorization algorithm Welch knot with Powell. The intersection of Data represented in the graph, which is then solved by coloring the vertices, then look for the value of the effective duration of the time compared to a traffic light settings occur at several intersections in Yogyakarta. Completion of traffic light arrangement using staining nodes provide alternative solutions duration lit the red light and green light is more effective than the secondary data at several intersections in Yogyakarta.

Sign in / Sign up

Export Citation Format

Share Document