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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
