Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
2,098
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
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 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 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 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
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 Digraphs with Non-derogatory Adjacency Matrix
- BULLETIN OF THE MALAYSIAN MATHEMATICAL SOCIETY
, 1998
"... Let G be a digraph with n vertices and A(G) be its adjacency matrix. A monic polynomial f(x) of degree at most n is called an annihilating polynomial of G if.0))( ( =GAf G is said to be annihilatingly unique if it possesses a unique annihilating polynomial. We prove that two families of digraphs, ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Let G be a digraph with n vertices and A(G) be its adjacency matrix. A monic polynomial f(x) of degree at most n is called an annihilating polynomial of G if.0))( ( =GAf G is said to be annihilatingly unique if it possesses a unique annihilating polynomial. We prove that two families of digraphs
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
Cospectral Graphs and the Generalized Adjacency Matrix
- LINEAR ALGEBRA AND ITS APPLICATIONS 423 (2007) 33–41
, 2007
"... Let J be the all-ones matrix, and let A denote the adjacency matrix of a graph. An old result of Johnson and Newman states that if two graphs are cospectral with respect to yJ − A for two distinct values of y, then they are cospectral for all y. Here we will focus on graphs cospectral with respect t ..."
Abstract
- Add to MetaCart
Let J be the all-ones matrix, and let A denote the adjacency matrix of a graph. An old result of Johnson and Newman states that if two graphs are cospectral with respect to yJ − A for two distinct values of y, then they are cospectral for all y. Here we will focus on graphs cospectral with respect
Results 1 - 10
of
2,098
