The advances in wireless communication techniques, mobile cloud computing, automotive and intelligent terminal technology are driving the evolution of vehicle ad hoc networks into the Internet of Vehicles (IoV) paradigm. This leads to a change in the vehicle routing problem from a calculation based on static data towards real-time traffic prediction. In this paper, we first address the taxonomy of cloud-assisted IoV from the viewpoint of the service relationship between cloud computing and IoV. Then, we review the traditional traffic prediction approached used by both Vehicle to Infrastructure (V2I) and Vehicle to Vehicle (V2V) communications. On this basis, we propose a mobile crowd sensing technology to support the creation of dynamic route choices for drivers wishing to avoid congestion. Experiments were carried out to verify the proposed approaches. Finally, we discuss the outlook of reliable traffic prediction.

Topological indices are numbers related to sub-atomic graphs to allow quantitative structure-movement/property/danger connections. These topological indices correspond to some specific physico-concoction properties such as breaking point, security, strain vitality of chemical compounds. The idea of topological indices were set up in compound graph hypothesis in view of vertex degrees. These indices are valuable in the investigation of mitigating exercises of specific Nanotubes and compound systems. In this paper, we discuss Zagreb types of indices and Zagreb polynomials for a few Nanotubes covered by cycles.

The atom-bond connectivity (ABC) index is one of the most actively studied degree-based graph invariants, which are found in a vast variety of chemical applications. For a simple graph G, it is defined as ABC(G) = Σ _uv∈E(G) ((d(u) + d(v) - 2)/(d(u)d(v))) ^1/2 , where d(v) denotes the degree ofa vertex v of G. Recently in [17] graphs with n vertices, 2n - 4 and 2n - 3 edges, and maximum ABC index were characterized. Here, we consider the next, more complex case, and characterize the graphs with n vertices, 2n - 2 edges, and maximum ABC index.

The Cartesian product and join are two classical operations in graphs. Let $d_{L(G)}(e)$ be the degree of a vertex $e$ in line graph $L(G)$ of a graph $G$. The edge versions of atom-bond connectivity ($AB{C}_e$) and geometric arithmetic ($G{A}_e$) indices of G are defined as ${\displaystyle \sum _{ef\in E(L(G))}\sqrt{\frac{d_{L(G)}(e)+d_{L(G)}(f)-2}{d_{L(G)}(e)\times d_{L(G)}(f)}}}$ and ${\displaystyle \sum _{ef\in E(L(G))}\frac{2\sqrt{d_{L(G)}(e)\times d_{L(G)}(f)}}{d_{L(G)}(e)+d_{L(G)}(f)}}$, respectively. In this paper, $AB{C}_e$ and $G{A}_e$ indices for certain Cartesian product graphs (such as $P_n\square P_m$, $P_n\square C_m$ and $P_n\square S_m$) are obtained. In addition, $AB{C}_e$ and $G{A}_e$ indices of certain join graphs (such as $C_m+P_n+S_r$, $P_m+P_n+P_r$, $C_m+C_n+C_r$ and $S_m+S_n+S_r$) are deduced. Our results enrich and revise some known results.