Abstract
AbstractIn an undirected graph obtained by abstracting traffic and communication networks, evaluation of the centrality of a vertex is interesting from the viewpoint of graph theory. the purpose of discussion of the centrality function is to provide a theoretical basis for solution of the problem. This paper is an attempt to extend the notion of the centrality function defined for the ujidirected graph to the directed graph. the existence conditions of the quasi‐stable and unstable graphs for the centrality functions with general coefficients are derived from the viewpoint of structural stability of the undirected graphs, for which the classification of the graphs is made by the shift of the center by adding an edge with the central vertex as an end point. Furthermore, the stability of the directed graphs is discussed.
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 callMore From: Electronics and Communications in Japan (Part I: Communications)
Disclaimer: 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.
