Currently displaying 1 – 3 of 3

Showing per page

Order by Relevance | Title | Year of publication

On the inverse of the adjacency matrix of a graph

Alexander FarrugiaJohn Baptist GauciIrene Sciriha — 2013

Special Matrices

A real symmetric matrix G with zero diagonal encodes the adjacencies of the vertices of a graph G with weighted edges and no loops. A graph associated with a n × n non–singular matrix with zero entries on the diagonal such that all its (n − 1) × (n − 1) principal submatrices are singular is said to be a NSSD. We show that the class of NSSDs is closed under taking the inverse of G. We present results on the nullities of one– and two–vertex deleted subgraphs of a NSSD. It is shown that a necessary...

Coalescing Fiedler and core vertices

Didar A. AliJohn Baptist GauciIrene ScirihaKhidir R. Sharaf — 2016

Czechoslovak Mathematical Journal

The nullity of a graph G is the multiplicity of zero as an eigenvalue in the spectrum of its adjacency matrix. From the interlacing theorem, derived from Cauchy’s inequalities for matrices, a vertex of a graph can be a core vertex if, on deleting the vertex, the nullity decreases, or a Fiedler vertex, otherwise. We adopt a graph theoretical approach to determine conditions required for the identification of a pair of prescribed types of root vertices of two graphs to form a cut-vertex of unique...

Page 1

Download Results (CSV)