Addressing the Petersen graph

DOI10.1016/j.disc.2004.06.006zbMath1053.05079OpenAlexW2121129417MaRDI QIDQ1887643

Randall J. Elzinga, Kevin N. Vander Meulen, David 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

zbMATH Keywords

EigenvaluesAddressingDistance matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)

Related Items

The generalized distance spectrum of a graph and applications ⋮ The normalized distance Laplacian ⋮ Wiener index and addressing of some finite graphs ⋮ Graphs with three distinct distance eigenvalues ⋮ Clique partitions of distance multigraphs ⋮ Wiener index and addressing of the total graph ⋮ Addressing Johnson Graphs, Complete Multipartite Graphs, Odd Cycles, and Random Graphs ⋮ Unnamed Item ⋮ Distance spectra of graphs: a survey ⋮ Addressing graph products and distance-regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Proof of the squashed cube conjecture
• Biclique decompositions and Hermitian rank
• On Isometric Embeddings of Graphs
• Matrix Analysis
• Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
• On the Addressing Problem for Loop Switching
• On the Addressing Problem of Loop Switching

This page was built for publication: Addressing the Petersen graph