Computation of topological descriptors and energy for graph-based binary codes (Q7006758)

\(G\) is said to be a threshold graph if and only if it can be generated by a binary code of the form \(0^{a_1} 1^{ b_1} 0^{a_2} 1^{b_2} \ldots 0^{a_h} 1^{b_h}\), where \(a_i\) and \(b_i\) are positive integers for all \(1 \leq i \leq h\). The authors in this paper show that for each prime number \(p\) and for each positive integer \(n\), the zero-divisor graph of the ring \(Z_p[x]/(x^n)\) is a connected threshold graph and present its binary generating code. They also compute some topological indices of a generic connected threshold graph using its binary generating code.\N\NA graph \(G\) of order \(n\) is said to be hyper-energetic if \(E(G) > E(K_n)\), where \(E(G)\) denotes the energy of the graph. The authors in this paper find some new families of hyper-energetic threshold graphs.