• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 2,098
Next 10 →

Adjacency matrix:

by Andrew Childs, Quantum Algorithms, Schrödinger Equation , 2003
"... Quantum systems evolve according to the ..."
Abstract - Add to MetaCart
Quantum systems evolve according to the

ADJACENCY MATRIX, EIGENVALUES ADJACENCY MATRIX

by Maria Pospelova, K Peterson
"... - 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

by Jonathan Aldrich, Charlie Garrod, C Garrod, J Aldrich, W Scherlis Administrivia
"... Two common representations ..."
Abstract - Add to MetaCart
Two common representations

Adjacency Matrix (undirected)

by unknown authors , 2015
"... I Exploit lower dimensional topology ..."
Abstract - Add to MetaCart
I Exploit lower dimensional topology

Adjacency Matrix vs. Lists

by David P. Feldman
"... 2. Variations on networks 3. Basic structural properties of networks ..."
Abstract - Add to MetaCart
2. Variations on networks 3. Basic structural properties of networks

REDUCING THE ADJACENCY MATRIX OF A TREE

by Gerd H. Fricke , Stephen T. Hedetniemi , David P. Jacobs , Vilmar Trevisan , 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

by Francisco Torrens , 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

by C. L. Deng, C. S. Gan - 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

by R. B. Bapat, Souvik Roy , 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

by E. R. Van Dam , W. H. Haemers , J. H. Koolen - 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
Next 10 →
Results 1 - 10 of 2,098
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University