Proximity Prestige of a Vertex in Some Graph Families

Authors

  • Lysandra A. Toladro Department of Mathematics, College of Arts and Sciences, Central Mindanao University, Musuan, Maramag, Bukidnon, 8710 Philippines
  • Isagani Cabahug Department of Mathematics, College of Arts and Sciences, Central Mindanao University, Musuan, Maramag, Bukidnon, 8710 Philippines

DOI:

https://doi.org/10.29020/nybg.ejpam.v18i2.5943

Keywords:

Proximity prestige, distance, graph families

Abstract

Let G = (V, E) be an undirected graph where V and E are the set of vertices and edges respectively. The proximity prestige (P P) of a vertex vi is the sum of the shortest path distance between vertex i and j all over the number of vertices in the graph. Proximity prestige (P P) emphasizes the importance of both reachability and distance. Here, general properties of proximity prestige in some graph classes, including path, cycle, complete, friendship, complete bipartite, star, fan and wheel were determined.

Downloads

Published

2025-05-01

Issue

Vol. 18 No. 2: (April 2025)

Section

Discrete Mathematics

License

Copyright (c) 2025 Lysandra A. Toladro, Isagani Cabahug

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

Upon acceptance of an article by the European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.

By agreeing to this statement, you acknowledge that:

  • You retain full copyright over your work.
  • The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
  • This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.

How to Cite

Proximity Prestige of a Vertex in Some Graph Families. (2025). European Journal of Pure and Applied Mathematics, 18(2), 5943. https://doi.org/10.29020/nybg.ejpam.v18i2.5943