Name
Title | ||
|---|---|---|
Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts |
Abstract | ||
|---|---|---|
Let K"n be the complete graph of order n. Assume that (G"1,G"2,G"3) is a 3-decomposition of K"n such that G"i is connected for each i=1,2,3. Then for any sufficiently large n, 5n2@?@?i=13W(G"i)@?n^3-n3+n2+2(n-1). We also prove that both bounds are best possible. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.dam.2011.06.016 | Discrete Applied Mathematics |
Keywords | Field | DocType |
diameter,wiener index,complete graph,order n,nordhaus-gaddum-type theorem,large n,decomposition | Complete graph,Graph,Discrete mathematics,Combinatorics,Wiener index,Function composition,Mathematics | Journal |
Volume | Issue | ISSN |
159 | 15 | Discrete Applied Mathematics |
Citations | PageRank | References |
5 | 0.49 | 12 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daobin Li | 1 | 11 | 1.42 |
| Baoyindureng Wu | 2 | 99 | 24.68 |
| Xunuan Yang | 3 | 5 | 0.83 |
| Xinhui An | 4 | 18 | 5.55 |