Addressing graph products and distance-regular graphs
From MaRDI portal
Publication:2012052
DOI10.1016/j.dam.2017.05.018zbMath1367.05176arXiv1609.05995MaRDI QIDQ2012052
Sebastian M. Cioabă, Kevin N. Vander Meulen, Randall J. Elzinga, Michelle Markiewitz, Trevor Vanderwoerd
Publication date: 27 July 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.05995
05C75: Structural characterization of families of graphs
05C12: Distance in graphs
05C40: Connectivity
05C76: Graph operations (line graphs, products, etc.)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The inertia of distance matrices of some graphs
- Proof of the squashed cube conjecture
- Nearly-neighborly families of tetrahedra and the decomposition of some multigraphs
- Biclique decompositions and Hermitian rank
- The Gewirtz graph: An exercise in the theory of graph spectra
- Distance-regular graphs the distance matrix of which has only one positive eigenvalue
- Addressing the Petersen graph
- Variations on a theme of Graham and Pollak
- On the distance spectrum of distance regular graphs
- Bipartite decomposition of random graphs
- A q-Analogue of the Addressing Problem of Graphs by Graham and Pollak
- More on the Bipartite Decomposition of Random Graphs
- Distance spectrum of graph compositions
- Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
- Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem
- On the Addressing Problem for Loop Switching
- On the Addressing Problem of Loop Switching
- Decomposition of Random Graphs into Complete Bipartite Graphs
