Abstract
Abstract Grid implementation is a principal unit in electrical and electronic engineering but it depends on the domain of these projects. For example, depending on the grid and the signal processing in that fields of electronic and electrical engineering, such as more abstract mathematics in signal conversion and e-transmission theory griding, etc. Provides transmission through grid nodes. Graph theory is very useful in research fields. As topological indices, there are more actual numbers associated with chemical composition complaints connected to the chemical grid with physical and chemical properties and reactions. In this paper, we expand the work to interconnected grid and examine the first Zagreb, the second Zagreb, Randic, sum-connectivity, harmonic, geometric, and atom bond connectivity exponents of hierarchical hypercube network based on vertex-edge and edge-vertex degree.
Highlights
It usually requires a multi-processor interconnect grid to connect to thousands of analogs, copies of processor-memory pairs, each this pairing is called processing node
The vertex-edge degree, denoted by φ ve(y), defined in Cancan (2019) of the node y ∈V, is equal to the number of links that are joined to any nodes from the closed neighborhood of y but in this collection there is not repetition occur
We manipulate the precise results for the edge-vertex degree based Zagreb and Randic indices, vertex-edge degree based First Zagreb alpha, first Zagreb beta, the second Zagreb, Randic, atombond connectivity, geometric-arithmetic, harmonic, and sum-connectivity indices for the hierarchical hypercube network HHN − 1 and HHN − 2
Summary
It usually requires a multi-processor interconnect grid to connect to thousands of analogs, copies of processor-memory pairs, each this pairing is called processing node. The vertex-edge degree Randic indices is define as: This part comprises of some primary concepts related to graph which is usually represented by H = (V,E) where V represents collection of nodes and E is collection of links of graph. The vertex-edge degree, denoted by φ ve(y), defined in Cancan (2019) of the node y ∈V , is equal to the number of links that are joined to any nodes from the closed neighborhood of y but in this collection there is not repetition occur. We splits the nodes and links, based on vertex-edge degree of (HHN-1)n×n for n ≥ 2 in Tables 2 and 3
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
