Results 61 to 70 of about 2,691 (126)
The Nullity Theorem for Principal Pivot Transform
We generalize the nullity theorem of Gustafson [Linear Algebra Appl. (1984)] from matrix inversion to principal pivot transform. Several special cases of the obtained result are known in the literature, such as a result concerning local complementation ...
Brijder, Robert
core +1 more source
Graphs with the second signless Laplacian eigenvalue ≤ 4
We discuss the question of classifying the connected simple graphs H for which the second largest eigenvalue of the signless Laplacian Q(H) is ≤ 4. We discover that the question is inextricable linked to a knapsack problem with infinitely many allowed ...
Drury Stephen
doaj +1 more source
On the sandpile model of modified wheels II
We investigate the abelian sandpile group on modified wheels Wˆn{\hat{W}}_{n} by using a variant of the dollar game as described in [N. L. Biggs, Chip-Firing and the critical group of a graph, J. Algebr. Comb. 9 (1999), 25–45].
Raza Zahid+3 more
doaj +1 more source
On Almost Distance-Regular Graphs [PDF]
2010 Mathematics Subject Classification: 05E30, 05C50;distance-regular graph;walk-regular graph;eigenvalues;predistance ...
Dalfo, C.+4 more
core +1 more source
On the N-spectrum of oriented graphs
Given any digraph D, its non-negative spectrum (or N-spectrum, shortly) consists of the eigenvalues of the matrix AA T, where A is the adjacency matrix of D.
Abudayah Mohammad+2 more
doaj +1 more source
The Maximum Order of Adjacency Matrices With a Given Rank [PDF]
AMS Subject Classification: 05B20, 05C50.Graph;Adjacency ...
Haemers, W.H., Peeters, M.J.P.
core +1 more source
Spectra of Graphs Resulting from Various Graph Operations and Products: a Survey
Let G be a graph on n vertices and A(G), L(G), and |L|(G) be the adjacency matrix, Laplacian matrix and signless Laplacian matrix of G, respectively. The paper is essentially a survey of known results about the spectra of the adjacency, Laplacian and ...
Barik S., Kalita D., Pati S., Sahoo G.
doaj +1 more source
As a generalization of the Sierpiński-like graphs, the subdivided-line graph Г(G) of a simple connected graph G is defined to be the line graph of the barycentric subdivision of G.
Shang Yilun
doaj +1 more source
Uniformity in Association schemes and Coherent Configurations: Cometric Q-Antipodal Schemes and Linked Systems [PDF]
2010 Mathematics Subject Classification.
Dam, E.R. van+2 more
core +1 more source
Commuting decomposition of Kn1,n2,...,nk through realization of the product A(G)A(GPk )
In this paper, we introduce the notion of perfect matching property for a k-partition of vertex set of given graph. We consider nontrivial graphs G and GPk , the k-complement of graph G with respect to a kpartition of V(G), to prove that A(G)A(GPk ) is ...
Bhat K. Arathi, Sudhakara G.
doaj +1 more source