Addressing the Petersen graph
From MaRDI portal
Publication:1887643
DOI10.1016/J.DISC.2004.06.006zbMATH Open1053.05079OpenAlexW2121129417MaRDI QIDQ1887643FDOQ1887643
Randall J. Elzinga, Kevin N. Vander Meulen, D. A. Gregory
Publication date: 22 November 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2004.06.006
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Matrix Analysis
- On the Addressing Problem for Loop Switching
- Title not available (Why is that?)
- On Isometric Embeddings of Graphs
- Biclique decompositions and Hermitian rank
- Proof of the squashed cube conjecture
- Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
- On the Addressing Problem of Loop Switching
- Title not available (Why is that?)
Cited In (12)
- Wiener index and addressing of the total graph
- Addressing graph products and distance-regular graphs
- The generalized distance spectrum of a graph and applications
- Graphs with three distinct distance eigenvalues
- Title not available (Why is that?)
- On the addressing problem for directed graphs
- Distance spectra of graphs: a survey
- Title not available (Why is that?)
- Wiener index and addressing of some finite graphs
- Clique partitions of distance multigraphs
- The normalized distance Laplacian
- Addressing Johnson Graphs, Complete Multipartite Graphs, Odd Cycles, and Random Graphs
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)
