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 |
| Summary: | 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 of the each token of e ∈ E. The notion of the rational weight of G by Guerrero, Guerrero and Artes is the sum of the degree vertices in G divided by the order of G.
This paper investigates the properties of the graph parameter v(G) and illustrates this concept to some special classes of graphs, such as: paths, cycles, fans, wheel graphs, bipartite graphs, complete graphs and trees. In addition, this paper studies the relationship of v(G) to the aggregate and rational weight of the line graph of G. Furthermore, the calculation of the aggregate of a newly generated graph from the old ones through join and product operations. |
|---|