A new adjacency matrix for finite graphs
From MaRDI portal
Publication:1038792
DOI10.1007/s00006-008-0116-5zbMath1194.05099MaRDI QIDQ1038792
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
Markov chains; cycles; random graphs; graphs; Clifford algebra; fermion algebra; nilpotent adjacency matrix
05C38: Paths and cycles
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
15A66: Clifford algebras, spinors
05C45: Eulerian and Hamiltonian graphs
Related Items
Clifford algebra method for network expression, computation, and algorithm construction, Matrix Analysis and Omega Calculus, Spinorial formulations of graph problems, Hamiltonian cycle enumeration via fermion-zeon convolution, Elementary functions and factorizations of zeons, Norm inequalities in zeon algebras, Zeros of zeon polynomials and the zeon quadratic formula, 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 TO THE n-PARTICLE FERMION ALGEBRA
