scholarly journals Bounds for the energy of a complex unit gain graph

2021 ◽  
Vol 612 ◽  
pp. 1-29
Author(s):  
Aniruddha Samanta ◽  
M. Rajesh Kannan
Keyword(s):  
Mathematics ◽  
2019 ◽  
Vol 7 (10) ◽  
pp. 926 ◽  
Author(s):  
Abdullah Alazemi ◽  
Milica Anđelić ◽  
Francesco Belardo ◽  
Maurizio Brunetti ◽  
Carlos M. da Fonseca

Let T 4 = { ± 1 , ± i } be the subgroup of fourth roots of unity inside T , the multiplicative group of complex units. For a T 4 -gain graph Φ = ( Γ , T 4 , φ ) , we introduce gain functions on its line graph L ( Γ ) and on its subdivision graph S ( Γ ) . The corresponding gain graphs L ( Φ ) and S ( Φ ) are defined up to switching equivalence and generalize the analogous constructions for signed graphs. We discuss some spectral properties of these graphs and in particular we establish the relationship between the Laplacian characteristic polynomial of a gain graph Φ , and the adjacency characteristic polynomials of L ( Φ ) and S ( Φ ) . A suitably defined incidence matrix for T 4 -gain graphs plays an important role in this context.


Author(s):  
Ranjit Mehatari ◽  
M. Rajesh Kannan ◽  
Aniruddha Samanta
Keyword(s):  

2018 ◽  
Vol 341 (1) ◽  
pp. 81-86 ◽  
Author(s):  
Yi Wang ◽  
Shi-Cai Gong ◽  
Yi-Zheng Fan
Keyword(s):  

2019 ◽  
Vol 38 (2) ◽  
pp. 570-588 ◽  
Author(s):  
Yong Lu ◽  
Ligong Wang ◽  
Qiannan Zhou
Keyword(s):  

Author(s):  
SAI WANG ◽  
DEIN WONG ◽  
FENGLEI TIAN

An undirected graph $G$ is determined by its $T$ -gain spectrum (DTS) if every $T$ -gain graph cospectral to $G$ is switching equivalent to $G$ . We show that the complete graph $K_{n}$ and the graph $K_{n}-e$ obtained by deleting an edge from $K_{n}$ are DTS, the star $K_{1,n}$ is DTS if and only if $n\leq 2$ , and an odd path $P_{2m+1}$ is not DTS if $m\geq 2$ . We give an operation for constructing cospectral $T$ -gain graphs and apply it to show that a tree of arbitrary order (at least $5$ ) is not DTS.


Sign in / Sign up

Export Citation Format

Share Document