N. Rajagopal Reddy, S. Sharief Basha^*

Computer Systems Science and Engineering, Vol.46, No.1, pp. 579-596, 2023, DOI:10.32604/csse.2023.034527

Abstract The hesitancy fuzzy graphs (HFGs), an extension of fuzzy graphs, are useful tools for dealing with ambiguity and uncertainty in issues involving decision-making (DM). This research implements a correlation coefficient measure (CCM) to assess the strength of the association between HFGs in this article since CCMs have a high capacity to process and interpret data. The CCM that is proposed between the HFGs has better qualities than the existing ones. It lowers restrictions on the hesitant fuzzy elements’ length and may be used to establish whether the HFGs are connected negatively or favorably. Additionally, a CCM-based attribute DM approach is… More >

Basma Mohamed^1,*, Linda Mohaisen², Mohamed Amin¹

Intelligent Automation & Soft Computing, Vol.36, No.2, pp. 2349-2361, 2023, DOI:10.32604/iasc.2023.032930

Abstract In this paper, we consider the NP-hard problem of finding the minimum connected resolving set of graphs. A vertex set B of a connected graph G resolves G if every vertex of G is uniquely identified by its vector of distances to the vertices in B. A resolving set B of G is connected if the subgraph induced by B is a nontrivial connected subgraph of G. The cardinality of the minimal resolving set is the metric dimension of G and the cardinality of minimum connected resolving set is the connected metric dimension of G. The problem is solved heuristically… More >

C. Thilaga^*, P. B. Sarasija

Computer Systems Science and Engineering, Vol.45, No.3, pp. 2773-2782, 2023, DOI:10.32604/csse.2023.032303

Abstract Complex networks have been a prominent topic of research for several years, spanning a wide range of fields from mathematics to computer science and also to social and biological sciences. The eigenvalues of the Seidel matrix, Seidel Signless Laplacian matrix, Seidel energy, Seidel Signless Laplacian energy, Maximum and Minimum energy, Degree Sum energy and Distance Degree energy of the Unitary Cayley graphs [UCG] have been calculated. Low-power devices must be able to transfer data across long distances with low delay and reliability. To overcome this drawback a small-world network depending on the unitary Cayley graph is proposed to decrease the… More >

Waheed Ahmad Khan^1,*, Khurram Faiz¹, Abdelghani Taouti²

Intelligent Automation & Soft Computing, Vol.35, No.3, pp. 3317-3330, 2023, DOI:10.32604/iasc.2023.024484

Abstract Theory of the Cayley graphs is directly linked with the group theory. However, if there are uncertainties on the vertices or edges or both then fuzzy graphs have an extraordinary importance. In this perspective, numbers of generalizations of fuzzy graphs have been explored in the literature. Among the others, picture fuzzy graph (PFG) has its own importance. A picture fuzzy graph (PFG) is a pair defined on a = , where = is a picture fuzzy set on and = is a picture fuzzy set over the set such that for any edge with , and In this manuscript, we… More >

N. Rajagopal Reddy¹, Mohammad Zubair Khan², S. Sharief Basha³, Abdulrahman Alahmadi², Ahmed H. Alahmadi², Chiranji Lal Chowdhary^4,*

Computer Systems Science and Engineering, Vol.44, No.3, pp. 2637-2653, 2023, DOI:10.32604/csse.2023.029255

Abstract Decision-making (DM) is a process in which several persons concurrently engage, examine the problems, evaluate potential alternatives, and select an appropriate option to the problem. Technique for determining order preference by similarity to the ideal solution (TOPSIS) is an established DM process. The objective of this report happens to broaden the approach of TOPSIS to solve the DM issues designed with Hesitancy fuzzy data, in which evaluation evidence given by the experts on possible solutions is presents as Hesitancy fuzzy decision matrices, each of which is defined by Hesitancy fuzzy numbers. Findings: we represent analytical results, such as designing a… More >

Ali Ahmad¹, Roslan Hasni^2,*, Nahid Akhter³, Kashif Elahi⁴

CMC-Computers, Materials & Continua, Vol.70, No.2, pp. 2895-2904, 2022, DOI:10.32604/cmc.2022.015644

Abstract Chemical compounds are modeled as graphs. The atoms of molecules represent the graph vertices while chemical bonds between the atoms express the edges. The topological indices representing the molecular graph corresponds to the different chemical properties of compounds. Let be are two positive integers, and be the zero-divisor graph of the commutative ring . In this article some direct questions have been answered that can be utilized latterly in different applications. This study starts with simple computations, leading to a quite complex ring theoretic problems to prove certain properties. The theory of finite commutative rings is useful due to its… More >

Abdullah Baz¹, Mohammed Baz^2,*

Intelligent Automation & Soft Computing, Vol.31, No.2, pp. 1051-1069, 2022, DOI:10.32604/iasc.2022.020304

Abstract COVID-19 constitutes one of the devastating pandemics plaguing humanity throughout the centuries; within about 18 months since its appearing, the cumulative confirmed cases hit 173 million, whereas the death toll approaches 3.72 million. Although several vaccines became available for the public worldwide, the speed with which COVID-19 is spread, and its different mutant strains hinder stopping its outbreak. This, in turn, prompting the desperate need for devising fast, cheap and accurate tools via which the disease can be diagnosed in its early stage. Reverse Transcription Polymerase Chain Reaction (RTPCR) test is the mainstay tool used to detect the COVID-19 symptoms.… More >

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 >

Mahmoud Higazy^1,2,*, Taher A. Nofal¹

CMC-Computers, Materials & Continua, Vol.67, No.3, pp. 3401-3418, 2021, DOI:10.32604/cmc.2021.015790

Abstract The detection of error and its correction is an important area of mathematics that is vastly constructed in all communication systems. Furthermore, combinatorial design theory has several applications like detecting or correcting errors in communication systems. Network (graph) designs (GDs) are introduced as a generalization of the symmetric balanced incomplete block designs (BIBDs) that are utilized directly in the above mentioned application. The networks (graphs) have been represented by vectors whose entries are the labels of the vertices related to the lengths of edges linked to it. Here, a general method is proposed and applied to construct new networks designs.… More >