The D-weight of a graph
Let G = (V(G), E(G)) be finite, undirected graph containing no loops nor multiple edges, with vertex set V(G) and edge set E(G). The index of an edge e in G is the number of neighboring edges of e while the V-weight of G, denoted by w(G), is the total of the indices of edges present E(G). The ration...
Saved in:
主要作者: | |
---|---|
格式: | text |
出版: |
Animo Repository
2007
|
主題: | |
在線閱讀: | https://animorepository.dlsu.edu.ph/faculty_research/7820 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | De La Salle University |