Abstract
A new distance in finite graphs is defined through a game-theoretic approach. This distance arises when solving the problem about the fair cost, for a node in a graph, of attaining access to another node. The distance indicates the level of difficulty in the communication between any pair of nodes, on the understanding that the fewer paths there are between two nodes and the more nodes there are that form those paths, the greater the distance is.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.