Every Adjacency Matrix of a Simple Graph is a Soft Matrix

Abstract

This paper develops a connection between the soft set theory and the graph theory by demonstrating that the adjacency matrix of a simple graph can be modeled as a soft matrix. The authors delve into directed and undirected graphs in which they demonstrate that the adjacency matrix in a simple undirected graph is symmetrical indicating the two-directional nature of the edges. In the case of directed graphs, the adjacency matrix is a symmetric one in case the arc set is a symmetric set, but is non-symmetric otherwise. The paper makes the formal relation between the adjacency matrix and the soft matrix, and it is shown that an adjacency matrix of any simple undirected graph is a symmetric soft matrix. Using mathematical proofs and examples, the authors demonstrate that the adjacency matrix selflessly satisfies the structure of a soft matrix. This work makes a major contribution in the combination of graph theory with the soft set theory since the two are fundamental elements of mathematics. The results provide a fresh view to study graph structures in terms of soft set operations, which can find its way to other fields such as network analysis and soft computing. Also, the paper will show how to model graph relationships using soft matrices, which help to better understand the graph structures in mathematical computations. The aspect of the soft matrices as a tool of graph analysis followed by the authors introduces new opportunities to the further research and implementation, particularly in the areas of data analysis, decision-making, and network theory. This conceptual relationship between soft and adjacency matrices is a significant move in increasing the usefulness of both graph theory and soft set theory.