Bounds for the energy of a complex unit gain graph

DOI10.1016/J.LAA.2020.11.019zbMATH Open1459.05185arXiv2005.08634OpenAlexW3111739762MaRDI QIDQ2228513FDOQ2228513

Authors: Aniruddha Samanta, M. Rajesh Kannan 

Publication date: 17 February 2021

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: A $mathbbT$-gain graph, $Phi=(G,varphi)$, is a graph in which the function $varphi$ assigns a unit complex number to each orientation of an edge, and its inverse is assigned to the opposite orientation. The associated adjacency matrix $A(Phi)$ is defined canonically. The energy $mathcalE(Phi)$ of a $mathbbT$-gain graph $Phi$ is the sum of the absolute values of all eigenvalues of $A(Phi)$. We study the notion of energy of a vertex of a $mathbbT$-gain graph, and establish bounds for it. For any $mathbbT$-gain graph $Phi$, we prove that $2au(G)-2c(G)leqmathcalE(Phi)leq2au(G)sqrtDelta(G)$, where $au(G),c(G)$ and $Delta(G)$ are the vertex cover number, the number of odd cycles and the largest vertex degree of $G$, respectively. Furthermore, using the properties of vertex energy, we characterize the classes of $mathbbT$-gain graphs for which $mathcalE(Phi)=2au(G)-2c(G)$ holds. Also, we characterize the classes of $mathbbT$-gain graphs for which $mathcalE(Phi)=2au(G)sqrtDelta(G)$ holds. This characterization solves a general version of an open problem. In addition, we establish bounds for the energy in terms of the spectral radius of the associated adjacency matrix.

Full work available at URL: https://arxiv.org/abs/2005.08634

Recommendations

• Bounds for the rank of a complex unit gain graph in terms of its maximum degree
• Bounds for the rank of a complex unit gain graph in terms of the independence number
• Complex unit gain graphs of rank 2
• Spectral properties of complex unit gain graphs
• On the adjacency matrix of a complex unit gain graph

zbMATH Keywords

adjacency matrixbipartite graphmatching numbervertex cover numbergain energyvertex energy

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Signed and weighted graphs (05C22)

Cites Work

• Title not available (Why is that?)
• Signed graphs
• Spectral properties of complex unit gain graphs
• Graph energy change due to edge deletion
• On the energy of regular graphs
• On bounds for the energy of graphs and digraphs
• Large regular bipartite graphs with median eigenvalue 1
• Hermitian-adjacency matrices and Hermitian energies of mixed graphs
• Relation between the Hermitian energy of a mixed graph and the matching number of its underlying graph
• Bounds of graph energy in terms of vertex cover number
• Oriented gain graphs, line graphs and eigenvalues
• Inequalities and equalities for the Cartesian decomposition of complex matrices
• Lower bounds of graph energy in terms of matching number
• Relation between the skew energy of an oriented graph and its matching number
• Energy of a vertex
• The rank of a complex unit gain graph in terms of the matching number

Cited In (4)

• Gain distance matrices for complex unit gain graphs
• Bound of energy with real and complex roots of an intuitionistic fuzzy directed graph
• NEPS of complex unit gain graphs
• On bounds of \(A_\alpha\)-eigenvalue multiplicity and the rank of a complex unit gain graph

This page was built for publication: Bounds for the energy of a complex unit gain graph

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