Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: nullity

Sortuj według:

Ogranicz wyniki do:

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

The inertia of unicyclic graphs and bicyclic graphs

100%

Liu Y.

Discussiones Mathematicae - General Algebra and Applications

2013

tom 33

nr 1

109-115

Let G be a graph with n vertices and ν(G) be the matching number of G. The inertia of a graph G, In(G) = (n₊,n₋,n₀) is an integer triple specifying the numbers of positive, negative and zero eigenvalues of the adjacency matrix A(G), respectively. Let η(G) = n₀ denote the nullity of G (the multiplicity of the eigenvalue zero of G). It is well known that if G is a tree, then η(G) = n - 2ν(G). Guo et al. [Ji-Ming Guo, Weigen Yan and Yeong-Nan Yeh. On the nullity and the matching number of unicyclic graphs, Linear Algebra and its Applications, 431 (2009), 1293-1301.] proved if G is a unicyclic graph, then η(G) equals n - 2ν(G) - 1, n-2ν(G) or n - 2ν(G) + 2. Barrett et al. determined the inertia sets for trees and graphs with cut vertices. In this paper, we give the nullity of bicyclic graphs 𝓑ₙ⁺⁺. Furthermore, we determine the inertia set in unicyclic graphs and 𝓑ₙ⁺⁺, respectively.

On the inverse of the adjacency matrix of a graph

86%

Farrugia A., Gauci J. B., Sciriha I.

Special Matrices

2013

tom 1

28-41

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 and sufficient condition for two–vertex deleted subgraphs of G and of the graph ⌈(G−1) associated with G−1 to remain NSSDs is that the submatrices belonging to them, derived from G and G−1, are inverses. Moreover, an algorithm yielding what we term plain NSSDs is presented. This algorithm can be used to determine if a graph G with a terminal vertex is not a NSSD.

Ograniczanie wyników

1 Discussiones Mathematicae - General Algebra and Applications

1 Special Matrices

1 Farrugia A.

1 Gauci J. B.

1 Liu Y.

1 Sciriha I.

2 2013

Wyniki wyszukiwania

The inertia of unicyclic graphs and bicyclic graphs

On the inverse of the adjacency matrix of a graph