The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
A positive integer n is said to be Wiener graphical, if there exists a graph G with Wiener index n. In this paper, we prove that any positive integer n(≠ 2,5) is Wiener graphical. For any positive integer p, an interval [a,b] is said to be a p-Wiener interval if for each positive integer n ∈ [a,b] there exists a graph G on p vertices such that W(G) = n. For any positive integer p, an interval [a,b] is said to be p-Wiener free interval (p-hyper-Wiener free interval) if there exist no graph G on p...
Download Results (CSV)