User:Mpagey/Padmakar-Ivan Index

This is not a Wikipedia article: It is an individual user's work-in-progress page, and may be incomplete and/or unreliable. For guidance on developing this draft, see Wikipedia:So you made a userspace draft.

Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL
Easy tools: Citation bot (help) | Advanced: Fix bare URLs
This page was last edited by DePiep (talk | contribs) 12 years ago. (Update timer)

Finished writing a draft article? Are you ready to request an experienced editor review it for possible inclusion in Wikipedia? Submit your draft for review!

Consider a graph, $G$ , such that the edge connecting any two given points, $u$ and $v$ , in $G$ is denoted as $e$ . Let $n_{eu}(e|G)$ represent the number of edges of $G$ that are closer to point $u$ than point $v$ . Similarly, let $n_{ev}(e|G)$ represent the number of edges of $G$ that are closer to $v$ than $u$ . In this case, the Padmakar-Ivan Index of the graph $G$ , $PI(G)$ , is defined as: $PI(G)=\sum _{\forall {e}}\left(n_{eu}(e|G)+n_{ev}(e|G)\right)$

References

External links

Category:Graph_theory