The aggregate of a graph
Let G = (V, E) be a finite, undirected graph containing no loops nor multiple edges, where V is the vertex set with N points/vertices and E is the edge set containing M lines. The token of the edge e in G is the number of neighboring edges of e while the aggregate of G, denoted by v(G), is the sum o...
Saved in:
| Main Author: | |
|---|---|
| Format: | text |
| Published: |
Animo Repository
2007
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/faculty_research/7819 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |