Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
167 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

An Unique and Novel Graph Matrix for Efficient Extraction of Structural Information of Networks (1903.05341v1)

Published 13 Mar 2019 in cs.DM and math.CO

Abstract: In this article, we propose a new type of square matrix associated with an undirected graph by trading off the naturally imbedded symmetry in them. The proposed matrix is defined using the neighbourhood sets of the vertices. It is called as neighbourhood matrix and it is denoted by $ \mathcal{NM}(G)$ as this proposed matrix also exhibits a bijection between the product of the two graph matrices, namely the adjacency matrix and the graph Laplacian. This matrix can also be obtained by looking at every vertex and the subgraph with vertices from the first two levels in the level decomposition from that vertex. The two levels in the level decomposition of the graph give us more information about the neighbour of a vertex along with the neighbour of neighbour of a vertex. This insight is required and is found useful in studying the impact of broadcasting on social networks, in particular, and complex networks, in general. We establish several interesting properties of the $ \mathcal{NM}(G) $. In addition, we also show how to reconstruct a graph $G$, given a $ \mathcal{NM} (G)$. The proposed matrix is also found to solve many graph theoretic problems using less time complexity in comparison to the existing algorithms.

Citations (1)

Summary

We haven't generated a summary for this paper yet.