Bounds for the energy of a complex unit gain graph

DOI10.1016/j.laa.2020.11.019zbMath1459.05185arXiv2005.08634OpenAlexW3111739762MaRDI QIDQ2228513

Aniruddha Samanta, M. Rajesh Kannan

Publication date: 17 February 2021

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

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

zbMATH Keywords

bipartite graphadjacency matrixmatching numbervertex cover numbervertex energygain energy

Mathematics Subject Classification ID

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

Related Items (3)

On bounds of \(A_\alpha\)-eigenvalue multiplicity and the rank of a complex unit gain graph ⋮ NEPS of complex unit gain graphs ⋮ Gain distance matrices for complex unit gain graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Spectral properties of complex unit gain graphs
• Hermitian-adjacency matrices and Hermitian energies of mixed graphs
• Bounds of graph energy in terms of vertex cover number
• Oriented gain graphs, line graphs and eigenvalues
• Signed graphs
• 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
• Large regular bipartite graphs with median eigenvalue 1
• Graph energy change due to edge deletion
• Relation between the Hermitian energy of a mixed graph and the matching number of its underlying graph
• On bounds for the energy of graphs and digraphs
• Inequalities and equalities for the Cartesian decomposition of complex matrices

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