Special lssues
Table of Content

New Aspects of Computational Algorithms of Graphical Network in Fixed Point Theory

Submission Deadline: 30 December 2022 (closed)

Guest Editors

Prof. Ismail Naci Cangul, Bursa Uludag University, Turkey
Prof. Ahmet Sinan Cevik, Selcuk University, Turkey
Prof. Aftab Hussain, King Abdulaziz University, Saudi Arabia
Prof. Jamshaid Ahmad, University of Jeddah, Saudi Arabia


Iterative algorithms are utilized for the computation of approximate solutions of stationary and evolutionary problems associated with differential equations. A lot of iterative processes have been established. Fixed point technology in particular applies to computational biology, Networking, gaming, and graph theory etc.

A large variety of problems of analysis and applied mathematics relate to find solutions of nonlinear functional equations which can be formulated in terms of finding the fixed points of nonlinear mappings with help of iterative algorithms. In fact, fixed point theory are extremely substantial tools to determine the existence and uniqueness of solutions of various mathematical models exhibiting phenomena arising in a broad spectrum of fields, such as steady state temperature distribution, chemical equations, neutron transport theory,

economic theories, financial analysis, epidemics, biomedical research and flow of fluids etc.


Potential topics include but are not limited to the following:

· Solution of new iterative approximation schemes with its solutions

· Estimating New Algorithms with its Application

· New Characteristic of Algorithms

· New study of fuzzy set theory

· New study of Topological and graphical Networks

· New research article related to fuzzy mappings

· Existence, uniqueness of single or boundary value problems

· New Techniques of Computational Biology

· Persistence and metric graphs

· Method of Interpolative approximative contractions  


Algorithms; networks; graph theory; computational biology; fuzzy optimization; differential equations; fixed point theory.

Published Papers

  • Open Access


    On Some Ev-Degree and Ve-Degree Dependent Indices of Benes Network and Its Derived Classes

    Wenhu Wang, Hibba Arshad, Asfand Fahad, Imran Javaid
    CMES-Computer Modeling in Engineering & Sciences, Vol.135, No.2, pp. 1685-1699, 2023, DOI:10.32604/cmes.2022.023563
    (This article belongs to this Special Issue: New Aspects of Computational Algorithms of Graphical Network in Fixed Point Theory)
    Abstract One of the most recent developments in the field of graph theory is the analysis of networks such as Butterfly networks, Benes networks, Interconnection networks, and David-derived networks using graph theoretic parameters. The topological indices (TIs) have been widely used as graph invariants among various graph theoretic tools. Quantitative structure activity relationships (QSAR) and quantitative structure property relationships (QSPR) need the use of TIs. Different structure-based parameters, such as the degree and distance of vertices in graphs, contribute to the determination of the values of TIs. Among other recently introduced novelties, the classes of ev-degree and ve-degree dependent TIs have… More >

Share Link