Computing the partition dimension of certain families of Toeplitz graph
Sign Up to like & getrecommendations! Published in 2022 at "Frontiers in Computational Neuroscience"
DOI: 10.3389/fncom.2022.959105
Abstract: Let G = (V(G), E(G)) be a graph with no loops, numerous edges, and only one component, which is made up of the vertex set V(G) and the edge set E(G). The distance d(u, v)… read more here.
Keywords: partition; vertex; dimension certain; partition dimension ... See more keywords