J. D. Thenge, B. Surendranath Reddy, Rupali S. Jain
Abstract
In the present paper we define the notion of adjacency matrix and incidence matrix of a soft graph and derive some results regarding these matrices. We show that some of the classical results of graph theory does not hold for soft graphs.
OpenAlex reports 7 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In the present paper we define the notion of adjacency matrix and incidence matrix of a soft graph and derive some results regarding these matrices. We show that some of the classical results of graph theory does not hold for soft graphs.
Key concepts: Adjacency matrix, Incidence matrix, Mathematics, Combinatorics, Graph energy, Adjacency list, Regular graph, Discrete mathematics