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

DOI10.3934/AMC.2024045MaRDI QIDQ7006758zbMATH OpenFDO

Authors Rameez Raja, Samir Ahmad Wagay

Publication date 27 March 2025

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/AMC.2024045

zbMATH Keywords

binary generating codeenergythreshold graphtopological indiceszero-divisor graph

Mathematics Subject Classification ID

Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) General commutative ring theory and combinatorics (zero-divisor graphs, annihilating-ideal graphs, etc.) (13A70)

Review text

\(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.

Cites work

• Coloring of commutative rings
• Eigenvalues and energy in threshold graphs
• Eigenvalues of zero-divisor graphs of finite commutative rings
• Graph energy and topological descriptors of zero divisor graph associated with commutative ring
• Graphs and matrices
• scientific article; zbMATH DE number 3598234 (Why is no real title available?)
• Hyperenergetic and hypoenergetic graphs
• On the computation of Seidel Laplacian eigenvalues for graph-based binary codes
• Orbit codes of finite abelian groups and lattices
• Realization of zero-divisor graphs of finite commutative rings as threshold graphs
• Synchronization Problems Solvable by Generalized PV Systems
• The zero-divisor graph of a commutative ring
• THE ZERO-DIVISOR GRAPHS OF RINGS AND SEMIRINGS
• Zero-divisor graph of direct products of matrices over semirings

This page was built for publication: Computation of topological descriptors and energy for graph-based binary codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7006758)