Addressing the Petersen graph
From MaRDI portal
Recommendations
- Addressing graph products and distance-regular graphs
- Addressing Johnson graphs, complete multipartite graphs, odd cycles, and random graphs
- A \(q\)-analogue of the addressing problem of graphs by Graham and Pollak
- On the addressing problem for directed graphs
- scientific article; zbMATH DE number 5844218
Cites work
- scientific article; zbMATH DE number 51878 (Why is no real title available?)
- scientific article; zbMATH DE number 908803 (Why is no real title available?)
- Biclique decompositions and Hermitian rank
- Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
- Matrix Analysis
- On Isometric Embeddings of Graphs
- On the Addressing Problem for Loop Switching
- On the Addressing Problem of Loop Switching
- Proof of the squashed cube conjecture
Cited in
(12)- Wiener index and addressing of the total graph
- Addressing graph products and distance-regular graphs
- Graphs with three distinct distance eigenvalues
- The generalized distance spectrum of a graph and applications
- 4-hyperclique decompositions of 3-hyperdistance multihypergraphs of multipartite graphs
- scientific article; zbMATH DE number 3882487 (Why is no real title available?)
- On the addressing problem for directed graphs
- Addressing Johnson graphs, complete multipartite graphs, odd cycles, and random graphs
- Distance spectra of graphs: a survey
- Wiener index and addressing of some finite graphs
- Clique partitions of distance multigraphs
- The normalized distance Laplacian
This page was built for publication: Addressing the Petersen graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1887643)
