On some spectral properties of complex unit gain graph

Let ? = (G, ?) be a T-gain graph. In this note we show that ? has one positive and negative eigenvalues if and only if it is switching equivalent to a balanced complete bipartite graph or complete tripartite with special weights. In addition, we found some lower bounds for the energy of a T-gain graph.

Authors

Institutions

Publication Details

Journal
Filomat
Published
2025-01-01
DOI
https://doi.org/10.2298/fil2503975a
Primary Topic
Graph theory and applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On some spectral properties of complex unit gain graph

Maryam Khosravi, Vahid Adish
Filomat
Graph theory and applications
article

On some spectral properties of complex unit gain graph

Maryam Khosravi, Vahid Adish
article en

Abstract

Let ? = (G, ?) be a T-gain graph. In this note we show that ? has one positive and negative eigenvalues if and only if it is switching equivalent to a balanced complete bipartite graph or complete tripartite with special weights. In addition, we found some lower bounds for the energy of a T-gain graph.

FilomatVol. 39(3)
Shahid Bahonar University of Kerman (IR)
Openalex Percentile: Top 75%
Graph theory and applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

On some spectral properties of complex unit gain graph — Maryam Khosravi, Vahid Adish · Filomat (2025) | TGRS Research Map | TGRS