Skip to content
Open access

A Spectral Approach to Join Based Operations on Graphs

Jul 2026 · Baghdad Science Journal · 0 citations

TL;DR

This study explores the spectral characteristics and energy distributions associated with selected graph operations derived from the first Zagreb, second Zagreb, and sum-connectivity matrices to contribute to understanding how algebraic operations induce spectral energy shifts analogous to perturbations in physical or molecular graph systems.

Abstract

The success of Spectral Graph Theory is due to its immense applications in several fields of science and technology. The parameter `graph energy' plays a significant role in the Hückel Molecular Orbital Theory, where it is used to approximate the total π -electron energy of conjugated hydrocarbons. Several modified versions of the energy parameter have been defined by many researchers depending on the context. This study explores the spectral characteristics and energy distributions associated with selected graph operations derived from the first Zagreb, second Zagreb, and sum-connectivity matrices. When the adjacency matrix provides information only on the existence of a relation among vertex pairs, these refined matrices give more information and weightage to the relation. These matrix-based energies quantify the total spectral energy of a system and provide insight into how structural modifications affect global stability and information distribution. The characteristic polynomials and corresponding eigenvalue spectra of the central graph are obtained for each matrix type, revealing how the spectral measures evolve under structural transformation. The analysis is further extended to the Indu–Bala product of graphs, a non-commutative operation that intricately merges the structural components of two graphs. The explicit expressions for the characteristic polynomial and spectral energies are derived, illustrating the effect of graph composition on spectral distribution. Additionally, for the operations of double-duplication and duplication vertex-join, the closed-form relations for the Zagreb and sum-connectivity spectra and their corresponding energy values are presented. The obtained results contribute to understanding how algebraic operations induce spectral energy shifts analogous to perturbations in physical or molecular graph systems.

Read PDF

Similar papers

Open access Jul 2026

Second Hyper Zagreb Spectral Radii of Graph Operations

A novel extension of the spectral invariant called Second Hyper Zagreb spectral radius is obtained by replacing the adjacency matrix with the Second Hyper Zagreb matrix and the two graph operations that are primarily covered are splitting and shadow graphs.

A. Bilal, Muhammad Mobeen Munir · 0 citations
Review Jul 2026

Contributions in Algebraic Graph Theory

This thesis investigates two central directions in algebraic graph theory, with an emphasis on spectral methods: spectral determination of graphs and transitivity properties of generalized-Hamming graphs and their complements. The first part focuses on graphs that are determined by the spectra of associated matrices. W...

Noam Krupnik · 0 citations
Open access Aug 2026

Partition-based construction and stability analysis of Euler graphs using vertex strength

The ‘divide and conquer’ paradigm proves to be one of the most frequently used techniques for dealing with the complexities of graph-related problems. Therefore, it is of great importance to measure the tendency of a vertex to be critical and its susceptibility in a graph. The criticality of a vertex is often analysed...

Saifur Rahman, Raju Doley · 0 citations
Open access Jul 2026

Evaluating the Influence of Graph Density on the Efficiency of Shortest Path Algorithms Using Different Data Structures

This paper presents a comparative analysis of two variants of a classical algorithm for finding the shortest path in a connected graph. The first variant uses an adjacency matrix (AM) to verify the existence of an edge (arc) between two vertices, while the second variant performs the same verification using an adjacenc...

V. Kralev, Radoslava Kraleva, Aleksandra Popova · 0 citations
Open access Jul 2026

Path Energy Bounds For Hub-Centric Graphs Of Order 2n+1 With Algorithmic Computation

An explicit spectral construction is developed enabling the numerical validation algorithm to evaluate the time complexity in various structural configurations of (2n+1)-graphs, highlighting the substantial algorithmic demands for several graphs.

R. Jerlinkasmir, J. Veninstine Vivik, I. N. Cangul et al. · 0 citations
Open access Jul 2026

Laplacian Minimum Domination Energy of Some Derived Graphs

Graph energy is an important concept in spectral graph theory with applications in mathematics and chemistry. In this paper, we study the Laplacian minimum domination energy of derived graphs of some standard graphs. The main aim is to obtain formulas, properties, and bounds for this energy measure. The study considers...

Jagadeesh Rajanna, Ashwini Ankanahalli Shashidhara · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.