Rupkumar Mahapatra¹, Sovan Samanta², Madhumangal Pal¹, Jeong-Gon Lee^3,*, Shah Khalid Khan⁴, Usman Naseem⁵, Robin Singh Bhadoria⁶

CMC-Computers, Materials & Continua, Vol.68, No.1, pp. 1219-1233, 2021, DOI:10.32604/cmc.2021.015590

Abstract Graph colouring is the system of assigning a colour to each vertex of a graph. It is done in such a way that adjacent vertices do not have equal colour. It is fundamental in graph theory. It is often used to solve real-world problems like traffic light signalling, map colouring, scheduling, etc. Nowadays, social networks are prevalent systems in our life. Here, the users are considered as vertices, and their connections/interactions are taken as edges. Some users follow other popular users’ profiles in these networks, and some don’t, but those non-followers are connected directly to the popular profiles. That means,… More >

Ali Mustafa^1,2, M Najam ul Islam¹, Salman Ahmed^1,3,*

Computer Systems Science and Engineering, Vol.37, No.3, pp. 399-413, 2021, DOI:10.32604/csse.2021.015575

Abstract Consensus control of multi-agent systems is an innovative paradigm for the development of intelligent distributed systems. This has fascinated numerous scientific groups for their promising applications as they have the freedom to achieve their local and global goals and make their own decisions. Network communication topologies based on graph and matrix theory are widely used in a various real-time applications ranging from software agents to robotics. Therefore, while sustaining the significance of both directed and undirected graphs, this research emphases on the demonstration of a distributed average consensus algorithm. It uses the harmonic mean in the domain of multi-agent systems… More >