๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Cospectral graphs and the generalized adjacency matrix

โœ Scribed by E.R. van Dam; W.H. Haemers; J.H. Koolen

Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
257 KB
Volume
423
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the adjacency properties of paley gra
On the adjacency properties of paley graphs
โœ W. Ananchuen; L. Caccetta ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 614 KB

In the application of graph theory to problems arising in network design, the requirements of the network can be expressed in terms of restrictions on the values of certain graph parameters such as connectivity, edge-connectivity, diameter, and independence number. In this paper, we focus on network

Reduction procedures for calculating the
Reduction procedures for calculating the determinant of the adjacency matrix of some graphs and the singularity of square planar grids
โœ H.M. Rara ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 207 KB

Let G be a graph without loops and multiple edges. If V(G) = {vl, v2 .... , v,}, we define the adjacency matrix of G to be the n x n (0, D-matrix A(G) = (aij), where ais = l if viv s e E(G) and ais = 0 otherwise. G is said to be singular if the matrix A(G) is singular. Reduction procedures which wil