Name
Abstract | ||
|---|---|---|
Let C(C-n, W-n) denote the set of all weighted cycles with vertex set V (C-n) = {v(0), v(1), ... , v(n-1)}, edge set E(C-n) = {v(i)v(j) vertical bar j - i = +/- 1 mod n} and positive weight set W-n = {w(1) >= w(2) >= ... >= w(n) > 0}. A weighted cycle G* is an element of C (C-n, W-n) is called maximum if lambda 1(G*) >= lambda 1(G) for any G is an element of C(C-n, W-n). In this paper, we give some properties of the Perron vector for the maximum weighted graphs and then determine the maximum weighted cycle in C(C-n, W-n). |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1142/S179383091650021X | DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS |
Keywords | Field | DocType |
Weighted graph, spectral radius, Perron vector, maximum weighted cycle | Discrete mathematics,Graph,Combinatorics,Spectral radius,Vertex (geometry),Mathematics | Journal |
Volume | Issue | ISSN |
8 | 2 | 1793-8309 |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lu Lu | 1 | 3 | 3.13 |
| Qiongxiang Huang | 2 | 35 | 14.49 |
| Lin Chen | 3 | 1 | 0.69 |