Spectra of Graphs and Closed Distance Magic Labelings
Abstract
Let G=(V,E) be a graph of order n. A closed distance magic labeling of G is a bijection V(G)→ \1,… ,n\ for which there exists a positive integer k such that Σx∈ N[v] (x)=k for all v∈ V , where N[v] is the closed neighborhood of v. We consider the closed distance magic graphs in the algebraic context. In particular we analyze the relations between the closed distance magic labelings and the spectra of graphs. These results are then applied to the strong product of graphs with complete graph or cycle and to the circulant graphs. We end with a number theoretic problem whose solution results in another family of closed distance magic graphs somewhat related to the strong product.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.