Commuting decompositions of complete graphs

DOI10.1002/JCD.20112zbMath1115.05066OpenAlexW1964395996MaRDI QIDQ3427367

Saieed Akbari, Allen Herman

Publication date: 20 March 2007

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.20112

zbMATH Keywords

graph decompositionsadjacency matrices of graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (6)

On a construction using commuting regular graphs ⋮ Commutativity of the adjacency matrices of graphs ⋮ Some constructions of integral graphs ⋮ Commuting decomposition of \(K_{n_1,n_2,\dots,n_k}\) through realization of the product \(A(G)A\left(G^P_k\right)\) ⋮ Spectra of \((H_1, H_2)\)-merged subdivision graph of a graph ⋮ Eigenspace stability conditions in mean-field replica theories

This page was built for publication: Commuting decompositions of complete graphs