Abstract
In this paper we define a new graph-theoretic cyclicity index CW(G) as a natural generalization of the global cyclicity index C(G) when arbitrary resistances are allocated to each edge of an electrical network. Upper and lower bounds for CW(G) are then provided using a powerful technique, based on p-majorization which extends our prior studies. These new results on weighted majorization are of interest in themselves and may be applied also in other scenarios.
| Original language | English |
|---|---|
| Pages (from-to) | 1-11 |
| Number of pages | 11 |
| Journal | Journal of Inequalities and Applications |
| Volume | 2015 |
| Issue number | 113 |
| DOIs | |
| Publication status | Published - 2015 |
All Science Journal Classification (ASJC) codes
- Analysis
- Discrete Mathematics and Combinatorics
- Applied Mathematics
Keywords
- graphs
- p-Schur-convex functions
- p-majorization
- weighted global cyclicity index
Fingerprint
Dive into the research topics of 'Bounds for the global cyclicity index of a general network via weighted majorization'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver