A new adjacency matrix for finite graphs

DOI10.1007/S00006-008-0116-5MaRDI QIDQ1038792zbMATH OpenOpenAlexFDO

Authors G. S. Staples

Publication date 20 November 2009

Published in Advances in Applied Clifford Algebras (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00006-008-0116-5

zbMATH Keywords

Clifford algebracyclesfermion algebragraphsMarkov chainsnilpotent adjacency matrixrandom graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Clifford algebras, spinors (15A66)

Recommendations

• Nilpotent adjacency matrices, random graphs and quantum random variables
• Clifford algebras, random graphs, and quantum random variables
• Nilpotent adjacency matrices and random graphs.
• Reductions in computational complexity using Clifford algebras
• Spectral properties of Cayley graphs over \(M_{m \times n}(F_q)\)

Cited in

(24)

• Elementary functions and factorizations of zeons
• Norm inequalities in zeon algebras
• Zeros of zeon polynomials and the zeon quadratic formula
• Reduction procedures for calculating the determinant of the adjacency matrix of some graphs and the singularity of square planar grids
• Zeon matrix inverses and the zeon combinatorial Laplacian
• Zeon and idem-Clifford formulations of hypergraph problems
• Relation between graph of a lattice with respect to its ideals and corresponding adjacency matrix
• Zeon and idem-Clifford formulations of Boolean satisfiability
• Generalized zeon algebras: theory and application to multi-constrained path problems
• Zeon roots
• Zeons, orthozeons, and graph colorings
• Operator calculus and invertible Clifford Appell systems: theory and application on the n-particle fermion algebra
• Nilpotent adjacency matrices and random graphs.
• scientific article; zbMATH DE number 4139786 (Why is no real title available?)
• Adjacency Matrices
• Spinorial formulations of graph problems
• scientific article; zbMATH DE number 1498419 (Why is no real title available?)
• Clifford algebra method for network expression, computation, and algorithm construction
• Matrix Analysis and Omega Calculus
• Nilpotent adjacency matrices, random graphs and quantum random variables
• Binary linear codes via zeon and sym-Clifford algebras
• Hamiltonian cycle enumeration via fermion-zeon convolution
• Spectral properties of the zeon combinatorial Laplacian: cycles in finite graphs
• A new approach to MacMahon’s Partition Analysis and associated applications

This page was built for publication: A new adjacency matrix for finite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1038792)