Results 1  10
of
353,330
ADJACENCY MATRIX, EIGENVALUES ADJACENCY MATRIX
"...  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 ..."
Abstract
 Add to MetaCart
 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
, 2006
"... Cospectral graphs and the generalized adjacency matrix ..."
Adjacency Matrix vs. Lists
"... 2. Variations on networks 3. Basic structural properties of networks ..."
REDUCING THE ADJACENCY MATRIX OF A TREE
, 1996
"... Let T be a tree, A its adjacency matrix, and a scalar. We describe a lineartime 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 the chara ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Let T be a tree, A its adjacency matrix, and a scalar. We describe a lineartime 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
Computing the Permanent of the Adjacency Matrix for Fullerenes
, 2002
"... Motivation. Novel carbon allotropes, with finite molecular structure, including spherical fullerenes are nowadays currently produced and investigated. These compounds have beautiful architectures and show unusual properties that are very promising for the development of nanotechnologies. The Kekulé ..."
Abstract
 Add to MetaCart
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
On the adjacency matrix of a block graph
, 2013
"... 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 graph ..."
Abstract
 Add to MetaCart
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
Steganalysis by Subtractive Pixel Adjacency Matrix
"... This paper presents a novel method for detection of steganographic methods that embed in the spatial domain by adding a lowamplitude independent stego signal, an example of which is LSB matching. First, arguments are provided for modeling differences between adjacent pixels using firstorder and se ..."
Abstract

Cited by 38 (21 self)
 Add to MetaCart
This paper presents a novel method for detection of steganographic methods that embed in the spatial domain by adding a lowamplitude independent stego signal, an example of which is LSB matching. First, arguments are provided for modeling differences between adjacent pixels using first
Chromosome Representation through Adjacency Matrix
 in Evolutionary Circuit Synthesis”, 2002 NASA/DoD Conference on Evolvable Hardware
"... 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 cod ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
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
Results 1  10
of
353,330