the forwarding indices of graphs - a survey
Clicks: 250
ID: 194032
2013
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Steady Performance
30.0
/100
250 views
55 readers
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #23 of 95 articles by views in zhonghua yi xue za zhi
Most read
Least read
Bar heights use a square-root scale.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
A routing \(R\) of a connected graph \(G\) of order \(n\) is a collection of \(n(n-1)\) simple paths connecting every ordered pair of vertices of \(G\). The vertex-forwarding index \(\xi(G,R)\) of \(G\) with respect to a routing \(R\) is defined as the maximum number of paths in \(R\) passing through any vertex of \(G\). The vertex-forwarding index \(\xi(G)\) of \(G\) is defined as the minimum \(\xi(G,R)\) over all routings \(R\) of \(G\). Similarly, the edge-forwarding index \(\pi(G,R)\) of \(G\) with respect to a routing \(R\) is the maximum number of paths in \(R\) passing through any edge of \(G\). The edge-forwarding index \(\pi(G)\) of \(G\) is the minimum \(\pi(G,R)\) over all routings \(R\) of \(G\). The vertex-forwarding index or the edge-forwarding index corresponds to the maximum load of the graph. Therefore, it is important to find routings minimizing these indices and thus has received much research attention for over twenty years. This paper surveys some known results on these forwarding indices, further research problems and several conjectures, also states some difficulty and relations to other topics in graph theory.
| Reference Key |
xu2013opusculathe
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Jun-Ming Xu;Min Xu |
| Journal | zhonghua yi xue za zhi |
| Year | 2013 |
| DOI |
http://dx.doi.org/10.7494/OpMath.2013.33.2.345
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.