- first published in 1898 as the smallest example against the claim that a connected bridgeless cubic graph must have an edge colouring with three colours 2

Cospectral graphs and the generalized adjacency matrix

Two common representations

2. Variations on networks 3. Basic structural properties of networks

I Exploit lower dimensional topology

Let T be a tree, A its adjacency matrix, and a scalar. We describe a linear-time algorithm for reducing the matrix In + A. Applications include computing the rank of A, finding a maximum matching in T, computing the rank and determinant of the associated neighborhood matrix, and computing

structure count and permanent of the adjacency matrix are computed for these molecules. Method. A method for computation of the permanent of the adjacency matrix is herein optimized for fullerenes. The method finds exact values for permanents of adjacency matrices up to 60�60. Results. The results provide

A block graph is a graph in which every block is a complete graph. Let G be a block graph and let A be the adjacency matrix of G. We first obtain a formula for the determinant of A over reals. It is shown that A is nonsingular over IF2 if and only if the removal of any vertex from G produces a

This paper presents a novel method for detection of steganographic methods that embed in the spatial domain by adding a low-amplitude independent stego signal, an example of which is LSB matching. First, arguments are provided for modeling differences between adjacent pixels using first

The use of adjacency matrices to the chromosome coding in evolutionary circuits techniques is proposed. The approach is shown to overcome some of the drawbacks associated with other coding schemes simplifying the implementation of the evolution process. It is particularly shown that the proposed