Abstract
Abstract Transmission of a vertex u in a graph G is defined as T(u) = ∑v∈V(G) d(u,v) [1]. The expression T(G) = 1/2∑u,v∈V(G) d(u,v) is called the transmission of G. Further the cardinality of the set {T(u)/u ∈ V(G)} is addressed as the transmission dimension of G and is denoted by dimT(G) [5]. Closeness centrality of a vertex v in G is defined as the reciprocal of the transmission of v. Using this centrality measure, the most important vertices in the graph are identified. In this paper we have computed the transmission of every vertex of an r-regular caterpillar and a spanning tree of the hypercube network.
Sign-in/Register to access full text options 
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.
